./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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 b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:38:58,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:38:58,531 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 03:38:58,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:38:58,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:38:58,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:38:58,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:38:58,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:38:58,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:38:58,563 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:38:58,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:38:58,564 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:38:58,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:38:58,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:38:58,566 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:38:58,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:38:58,567 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:38:58,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:38:58,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:38:58,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:38:58,570 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:38:58,571 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:38:58,572 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:38:58,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:38:58,573 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:38:58,573 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:38:58,574 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:38:58,574 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:38:58,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:38:58,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:38:58,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:38:58,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:38:58,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:38:58,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:38:58,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:38:58,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:38:58,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:38:58,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:38:58,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:38:58,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:38:58,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:38:58,578 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_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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 -> b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d [2023-11-29 03:38:58,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:38:58,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:38:58,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:38:58,812 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:38:58,812 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:38:58,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2023-11-29 03:39:01,490 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:39:01,690 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:39:01,691 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2023-11-29 03:39:01,702 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/data/9c088afa6/3f135a13a43649ba9d1c69640a01f2c4/FLAG54ccbcb0f [2023-11-29 03:39:01,713 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/data/9c088afa6/3f135a13a43649ba9d1c69640a01f2c4 [2023-11-29 03:39:01,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:39:01,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:39:01,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:39:01,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:39:01,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:39:01,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:39:01" (1/1) ... [2023-11-29 03:39:01,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55646df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:39:01, skipping insertion in model container [2023-11-29 03:39:01,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:39:01" (1/1) ... [2023-11-29 03:39:01,769 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:39:02,011 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:39:02,023 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:39:02,061 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:39:02,091 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:39:02,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:39:02 WrapperNode [2023-11-29 03:39:02,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:39:02,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:39:02,093 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:39:02,093 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:39:02,099 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:39:02" (1/1) ... [2023-11-29 03:39:02,110 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:39:02" (1/1) ... [2023-11-29 03:39:02,130 INFO L138 Inliner]: procedures = 119, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 117 [2023-11-29 03:39:02,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:39:02,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:39:02,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:39:02,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:39:02,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:39:02" (1/1) ... [2023-11-29 03:39:02,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:39:02" (1/1) ... [2023-11-29 03:39:02,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:39:02" (1/1) ... [2023-11-29 03:39:02,159 INFO L175 MemorySlicer]: Split 22 memory accesses to 2 slices as follows [2, 20]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2023-11-29 03:39:02,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:39:02" (1/1) ... [2023-11-29 03:39:02,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:39:02" (1/1) ... [2023-11-29 03:39:02,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:39:02" (1/1) ... [2023-11-29 03:39:02,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:39:02" (1/1) ... [2023-11-29 03:39:02,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:39:02" (1/1) ... [2023-11-29 03:39:02,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:39:02" (1/1) ... [2023-11-29 03:39:02,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:39:02,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:39:02,181 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:39:02,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:39:02,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:39:02" (1/1) ... [2023-11-29 03:39:02,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:39:02,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:39:02,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:39:02,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:39:02,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 03:39:02,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 03:39:02,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 03:39:02,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 03:39:02,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:39:02,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:39:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:39:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:39:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:39:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:39:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:39:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:39:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 03:39:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:39:02,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:39:02,372 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:39:02,374 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:39:02,658 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:39:02,701 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:39:02,701 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-11-29 03:39:02,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:39:02 BoogieIcfgContainer [2023-11-29 03:39:02,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:39:02,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:39:02,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:39:02,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:39:02,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:39:01" (1/3) ... [2023-11-29 03:39:02,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2757c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:39:02, skipping insertion in model container [2023-11-29 03:39:02,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:39:02" (2/3) ... [2023-11-29 03:39:02,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2757c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:39:02, skipping insertion in model container [2023-11-29 03:39:02,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:39:02" (3/3) ... [2023-11-29 03:39:02,712 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-1.i [2023-11-29 03:39:02,728 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:39:02,729 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2023-11-29 03:39:02,770 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:39:02,776 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;@3d5d61cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:39:02,776 INFO L358 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2023-11-29 03:39:02,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 43 states have (on average 2.441860465116279) internal successors, (105), 88 states have internal predecessors, (105), 0 states have call successors, (0), 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:39:02,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 03:39:02,784 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:02,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 03:39:02,785 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:02,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:02,789 INFO L85 PathProgramCache]: Analyzing trace with hash 7165, now seen corresponding path program 1 times [2023-11-29 03:39:02,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:02,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457436585] [2023-11-29 03:39:02,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:02,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:02,959 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:39:02,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:02,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457436585] [2023-11-29 03:39:02,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457436585] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:39:02,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:39:02,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:39:02,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023583037] [2023-11-29 03:39:02,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:39:02,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:39:02,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:02,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:39:02,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:39:02,994 INFO L87 Difference]: Start difference. First operand has 89 states, 43 states have (on average 2.441860465116279) internal successors, (105), 88 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:39:03,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:03,102 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2023-11-29 03:39:03,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:39:03,104 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:39:03,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:03,113 INFO L225 Difference]: With dead ends: 89 [2023-11-29 03:39:03,113 INFO L226 Difference]: Without dead ends: 88 [2023-11-29 03:39:03,114 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:39:03,118 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 75 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:03,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 49 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:39:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-29 03:39:03,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2023-11-29 03:39:03,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 41 states have (on average 2.1951219512195124) internal successors, (90), 83 states have internal predecessors, (90), 0 states have call successors, (0), 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:39:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2023-11-29 03:39:03,155 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 2 [2023-11-29 03:39:03,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:03,156 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2023-11-29 03:39:03,156 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:39:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2023-11-29 03:39:03,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 03:39:03,156 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:03,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 03:39:03,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:39:03,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:03,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash 7166, now seen corresponding path program 1 times [2023-11-29 03:39:03,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:03,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733484543] [2023-11-29 03:39:03,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:03,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:03,240 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:39:03,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:03,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733484543] [2023-11-29 03:39:03,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733484543] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:39:03,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:39:03,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:39:03,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333059879] [2023-11-29 03:39:03,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:39:03,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:39:03,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:03,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:39:03,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:39:03,244 INFO L87 Difference]: Start difference. First operand 84 states and 90 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:39:03,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:03,398 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2023-11-29 03:39:03,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:39:03,398 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:39:03,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:03,400 INFO L225 Difference]: With dead ends: 110 [2023-11-29 03:39:03,400 INFO L226 Difference]: Without dead ends: 110 [2023-11-29 03:39:03,400 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:39:03,402 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 73 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:03,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 90 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:39:03,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-29 03:39:03,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 82. [2023-11-29 03:39:03,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 41 states have (on average 2.1463414634146343) internal successors, (88), 81 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:39:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2023-11-29 03:39:03,412 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 2 [2023-11-29 03:39:03,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:03,412 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2023-11-29 03:39:03,412 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:39:03,413 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2023-11-29 03:39:03,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 03:39:03,413 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:03,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 03:39:03,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:39:03,414 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:03,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:03,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1967738720, now seen corresponding path program 1 times [2023-11-29 03:39:03,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:03,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007399438] [2023-11-29 03:39:03,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:03,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:03,563 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:39:03,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:03,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007399438] [2023-11-29 03:39:03,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007399438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:39:03,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:39:03,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:39:03,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019525876] [2023-11-29 03:39:03,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:39:03,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:39:03,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:03,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:39:03,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:39:03,566 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:39:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:03,704 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2023-11-29 03:39:03,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:39:03,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 03:39:03,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:03,707 INFO L225 Difference]: With dead ends: 84 [2023-11-29 03:39:03,707 INFO L226 Difference]: Without dead ends: 84 [2023-11-29 03:39:03,707 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:39:03,708 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 111 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:03,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 31 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:39:03,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-29 03:39:03,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2023-11-29 03:39:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 75 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:39:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2023-11-29 03:39:03,717 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 6 [2023-11-29 03:39:03,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:03,717 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2023-11-29 03:39:03,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:39:03,718 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2023-11-29 03:39:03,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 03:39:03,718 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:03,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 03:39:03,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:39:03,719 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:03,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:03,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1967738719, now seen corresponding path program 1 times [2023-11-29 03:39:03,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:03,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768526443] [2023-11-29 03:39:03,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:03,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:03,897 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:39:03,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:03,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768526443] [2023-11-29 03:39:03,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768526443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:39:03,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:39:03,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:39:03,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045458821] [2023-11-29 03:39:03,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:39:03,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:39:03,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:03,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:39:03,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:39:03,899 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand has 6 states, 5 states have (on average 1.2) 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:39:04,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:04,123 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2023-11-29 03:39:04,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:39:04,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) 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:39:04,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:04,124 INFO L225 Difference]: With dead ends: 100 [2023-11-29 03:39:04,125 INFO L226 Difference]: Without dead ends: 100 [2023-11-29 03:39:04,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:39:04,126 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 107 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:04,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 58 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:39:04,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-29 03:39:04,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2023-11-29 03:39:04,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.6290322580645162) internal successors, (101), 87 states have internal predecessors, (101), 0 states have call successors, (0), 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:39:04,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2023-11-29 03:39:04,134 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 6 [2023-11-29 03:39:04,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:04,135 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2023-11-29 03:39:04,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) 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:39:04,135 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2023-11-29 03:39:04,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 03:39:04,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:04,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:39:04,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:39:04,136 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:04,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:04,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1211118797, now seen corresponding path program 1 times [2023-11-29 03:39:04,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:04,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289699230] [2023-11-29 03:39:04,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:04,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:04,228 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:39:04,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:04,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289699230] [2023-11-29 03:39:04,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289699230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:39:04,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:39:04,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:39:04,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975054490] [2023-11-29 03:39:04,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:39:04,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:39:04,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:04,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:39:04,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:39:04,232 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:39:04,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:04,361 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2023-11-29 03:39:04,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:39:04,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 03:39:04,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:04,362 INFO L225 Difference]: With dead ends: 87 [2023-11-29 03:39:04,362 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 03:39:04,363 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:39:04,364 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:04,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 95 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:39:04,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 03:39:04,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-29 03:39:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 86 states have internal predecessors, (100), 0 states have call successors, (0), 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:39:04,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2023-11-29 03:39:04,371 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 8 [2023-11-29 03:39:04,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:04,371 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2023-11-29 03:39:04,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:39:04,372 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2023-11-29 03:39:04,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 03:39:04,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:04,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:39:04,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:39:04,372 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:04,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:04,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1211118796, now seen corresponding path program 1 times [2023-11-29 03:39:04,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:04,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967446762] [2023-11-29 03:39:04,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:04,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:04,548 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:39:04,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:04,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967446762] [2023-11-29 03:39:04,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967446762] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:39:04,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:39:04,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:39:04,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111286652] [2023-11-29 03:39:04,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:39:04,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:39:04,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:04,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:39:04,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:39:04,551 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:39:04,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:04,702 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2023-11-29 03:39:04,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:39:04,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 03:39:04,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:04,703 INFO L225 Difference]: With dead ends: 86 [2023-11-29 03:39:04,704 INFO L226 Difference]: Without dead ends: 86 [2023-11-29 03:39:04,704 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:39:04,705 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 8 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:04,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 140 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:39:04,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-29 03:39:04,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2023-11-29 03:39:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 78 states have internal predecessors, (91), 0 states have call successors, (0), 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:39:04,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2023-11-29 03:39:04,712 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 8 [2023-11-29 03:39:04,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:04,712 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2023-11-29 03:39:04,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:39:04,712 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2023-11-29 03:39:04,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 03:39:04,713 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:04,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:39:04,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:39:04,713 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:04,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:04,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1479297325, now seen corresponding path program 1 times [2023-11-29 03:39:04,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:04,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138139380] [2023-11-29 03:39:04,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:04,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:04,850 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:39:04,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:04,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138139380] [2023-11-29 03:39:04,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138139380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:39:04,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:39:04,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:39:04,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755724307] [2023-11-29 03:39:04,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:39:04,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:39:04,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:04,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:39:04,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:39:04,852 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:39:04,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:04,979 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2023-11-29 03:39:04,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:39:04,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 03:39:04,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:04,980 INFO L225 Difference]: With dead ends: 89 [2023-11-29 03:39:04,980 INFO L226 Difference]: Without dead ends: 89 [2023-11-29 03:39:04,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:39:04,981 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 17 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:04,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 159 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:39:04,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-29 03:39:04,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2023-11-29 03:39:04,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.546875) internal successors, (99), 84 states have internal predecessors, (99), 0 states have call successors, (0), 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:39:04,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2023-11-29 03:39:04,988 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 12 [2023-11-29 03:39:04,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:04,988 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2023-11-29 03:39:04,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:39:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2023-11-29 03:39:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 03:39:04,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:04,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:39:04,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 03:39:04,990 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:04,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:04,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1950625586, now seen corresponding path program 1 times [2023-11-29 03:39:04,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:04,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829122681] [2023-11-29 03:39:04,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:04,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:05,194 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:39:05,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:05,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829122681] [2023-11-29 03:39:05,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829122681] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:39:05,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394034120] [2023-11-29 03:39:05,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:05,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:39:05,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:39:05,198 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:39:05,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:39:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:05,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 03:39:05,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:39:05,353 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:39:05,397 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:39:05,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-29 03:39:05,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 15 treesize of output 1 [2023-11-29 03:39:05,544 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:39:05,565 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:39:05,566 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:39:05,666 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:39:05,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394034120] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:39:05,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:39:05,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2023-11-29 03:39:05,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579367862] [2023-11-29 03:39:05,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:39:05,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 03:39:05,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:05,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 03:39:05,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-11-29 03:39:05,669 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 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:39:06,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:06,160 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2023-11-29 03:39:06,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 03:39:06,160 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 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 14 [2023-11-29 03:39:06,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:06,161 INFO L225 Difference]: With dead ends: 131 [2023-11-29 03:39:06,161 INFO L226 Difference]: Without dead ends: 131 [2023-11-29 03:39:06,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2023-11-29 03:39:06,163 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 262 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:06,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 134 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:39:06,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-29 03:39:06,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 101. [2023-11-29 03:39:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.5802469135802468) internal successors, (128), 100 states have internal predecessors, (128), 0 states have call successors, (0), 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:39:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2023-11-29 03:39:06,169 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 14 [2023-11-29 03:39:06,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:06,170 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2023-11-29 03:39:06,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 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:39:06,170 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2023-11-29 03:39:06,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 03:39:06,171 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:06,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:39:06,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:39:06,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:39:06,376 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:06,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:06,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1950625585, now seen corresponding path program 1 times [2023-11-29 03:39:06,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:06,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743186983] [2023-11-29 03:39:06,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:06,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:06,598 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:39:06,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:06,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743186983] [2023-11-29 03:39:06,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743186983] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:39:06,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333233846] [2023-11-29 03:39:06,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:06,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:39:06,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:39:06,600 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:39:06,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 03:39:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:06,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 03:39:06,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:39:06,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:39:06,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:39:06,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:06,831 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 19 treesize of output 15 [2023-11-29 03:39:06,875 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:39:06,875 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:39:06,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333233846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:39:06,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:39:06,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 12 [2023-11-29 03:39:06,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304971679] [2023-11-29 03:39:06,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:39:06,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:39:06,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:06,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:39:06,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:39:06,877 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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:39:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:07,148 INFO L93 Difference]: Finished difference Result 113 states and 128 transitions. [2023-11-29 03:39:07,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:39:07,148 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-11-29 03:39:07,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:07,149 INFO L225 Difference]: With dead ends: 113 [2023-11-29 03:39:07,149 INFO L226 Difference]: Without dead ends: 112 [2023-11-29 03:39:07,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:39:07,150 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 46 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:07,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 108 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:39:07,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-29 03:39:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 95. [2023-11-29 03:39:07,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 94 states have internal predecessors, (115), 0 states have call successors, (0), 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:39:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2023-11-29 03:39:07,155 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 14 [2023-11-29 03:39:07,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:07,156 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2023-11-29 03:39:07,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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:39:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2023-11-29 03:39:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 03:39:07,157 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:07,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:39:07,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 03:39:07,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:39:07,362 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:07,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:07,363 INFO L85 PathProgramCache]: Analyzing trace with hash -339904868, now seen corresponding path program 1 times [2023-11-29 03:39:07,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:07,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926175893] [2023-11-29 03:39:07,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:07,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:07,631 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:39:07,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:07,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926175893] [2023-11-29 03:39:07,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926175893] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:39:07,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:39:07,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:39:07,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578229715] [2023-11-29 03:39:07,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:39:07,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:39:07,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:07,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:39:07,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:39:07,633 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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:39:08,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:08,103 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2023-11-29 03:39:08,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 03:39:08,103 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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:39:08,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:08,104 INFO L225 Difference]: With dead ends: 134 [2023-11-29 03:39:08,104 INFO L226 Difference]: Without dead ends: 134 [2023-11-29 03:39:08,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-11-29 03:39:08,105 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 260 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:08,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 91 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:39:08,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-29 03:39:08,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 101. [2023-11-29 03:39:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.5308641975308641) internal successors, (124), 100 states have internal predecessors, (124), 0 states have call successors, (0), 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:39:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2023-11-29 03:39:08,110 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 15 [2023-11-29 03:39:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:08,110 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2023-11-29 03:39:08,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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:39:08,110 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2023-11-29 03:39:08,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 03:39:08,111 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:08,111 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:39:08,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 03:39:08,111 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:08,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash 329551461, now seen corresponding path program 1 times [2023-11-29 03:39:08,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:08,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14834907] [2023-11-29 03:39:08,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:08,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:08,271 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:39:08,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:08,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14834907] [2023-11-29 03:39:08,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14834907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:39:08,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:39:08,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:39:08,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730702594] [2023-11-29 03:39:08,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:39:08,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:39:08,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:08,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:39:08,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:39:08,273 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:39:08,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:08,441 INFO L93 Difference]: Finished difference Result 136 states and 159 transitions. [2023-11-29 03:39:08,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:39:08,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:39:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:08,443 INFO L225 Difference]: With dead ends: 136 [2023-11-29 03:39:08,443 INFO L226 Difference]: Without dead ends: 136 [2023-11-29 03:39:08,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:39:08,444 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 57 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:08,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 143 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:39:08,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-29 03:39:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2023-11-29 03:39:08,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.5119047619047619) internal successors, (127), 103 states have internal predecessors, (127), 0 states have call successors, (0), 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:39:08,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 127 transitions. [2023-11-29 03:39:08,448 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 127 transitions. Word has length 18 [2023-11-29 03:39:08,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:08,448 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 127 transitions. [2023-11-29 03:39:08,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:39:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 127 transitions. [2023-11-29 03:39:08,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 03:39:08,449 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:08,449 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:39:08,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 03:39:08,450 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:08,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:08,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1426446504, now seen corresponding path program 1 times [2023-11-29 03:39:08,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:08,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049606836] [2023-11-29 03:39:08,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:08,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:08,546 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:39:08,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:08,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049606836] [2023-11-29 03:39:08,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049606836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:39:08,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:39:08,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:39:08,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158343820] [2023-11-29 03:39:08,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:39:08,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:39:08,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:08,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:39:08,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:39:08,548 INFO L87 Difference]: Start difference. First operand 104 states and 127 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:39:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:08,730 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2023-11-29 03:39:08,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:39:08,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:39:08,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:08,731 INFO L225 Difference]: With dead ends: 128 [2023-11-29 03:39:08,731 INFO L226 Difference]: Without dead ends: 128 [2023-11-29 03:39:08,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:39:08,732 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 153 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:08,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 132 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:39:08,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-29 03:39:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 104. [2023-11-29 03:39:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 103 states have internal predecessors, (123), 0 states have call successors, (0), 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:39:08,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 123 transitions. [2023-11-29 03:39:08,736 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 123 transitions. Word has length 18 [2023-11-29 03:39:08,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:08,736 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 123 transitions. [2023-11-29 03:39:08,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:39:08,737 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2023-11-29 03:39:08,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 03:39:08,737 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:08,737 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:39:08,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 03:39:08,738 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:08,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:08,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2113307920, now seen corresponding path program 1 times [2023-11-29 03:39:08,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:08,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659658591] [2023-11-29 03:39:08,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:08,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:09,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:39:09,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:09,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659658591] [2023-11-29 03:39:09,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659658591] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:39:09,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781102238] [2023-11-29 03:39:09,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:09,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:39:09,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:39:09,008 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:39:09,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 03:39:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:09,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 03:39:09,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:39:09,118 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:39:09,192 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 03:39:09,192 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:39:09,235 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:39:09,315 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:39:09,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-29 03:39:09,340 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:39:09,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 03:39:09,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:39:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:39:09,480 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:39:09,538 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_377) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2023-11-29 03:39:09,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:09,551 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 20 treesize of output 21 [2023-11-29 03:39:09,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:09,561 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 37 [2023-11-29 03:39:09,565 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 5 [2023-11-29 03:39:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:39:09,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781102238] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:39:09,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:39:09,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2023-11-29 03:39:09,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380021693] [2023-11-29 03:39:09,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:39:09,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 03:39:09,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:09,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 03:39:09,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=359, Unknown=5, NotChecked=40, Total=506 [2023-11-29 03:39:09,845 INFO L87 Difference]: Start difference. First operand 104 states and 123 transitions. Second operand has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 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:39:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:11,136 INFO L93 Difference]: Finished difference Result 243 states and 273 transitions. [2023-11-29 03:39:11,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 03:39:11,137 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 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:39:11,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:11,139 INFO L225 Difference]: With dead ends: 243 [2023-11-29 03:39:11,140 INFO L226 Difference]: Without dead ends: 243 [2023-11-29 03:39:11,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=304, Invalid=1101, Unknown=5, NotChecked=72, Total=1482 [2023-11-29 03:39:11,141 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 607 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:11,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 473 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1116 Invalid, 0 Unknown, 264 Unchecked, 0.9s Time] [2023-11-29 03:39:11,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-11-29 03:39:11,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 148. [2023-11-29 03:39:11,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 128 states have (on average 1.5234375) internal successors, (195), 147 states have internal predecessors, (195), 0 states have call successors, (0), 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:39:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 195 transitions. [2023-11-29 03:39:11,148 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 195 transitions. Word has length 18 [2023-11-29 03:39:11,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:11,148 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 195 transitions. [2023-11-29 03:39:11,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 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:39:11,149 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 195 transitions. [2023-11-29 03:39:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 03:39:11,150 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:11,150 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:39:11,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 03:39:11,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 03:39:11,352 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:11,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:11,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2113307919, now seen corresponding path program 1 times [2023-11-29 03:39:11,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:11,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890915146] [2023-11-29 03:39:11,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:11,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:11,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:39:11,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:11,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890915146] [2023-11-29 03:39:11,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890915146] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:39:11,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894403938] [2023-11-29 03:39:11,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:11,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:39:11,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:39:11,665 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:39:11,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 03:39:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:11,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 03:39:11,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:39:11,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:39:11,842 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:39:11,851 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:39:11,852 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:39:11,903 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:39:11,907 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:39:11,983 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:39:11,984 INFO L378 Elim1Store]: Elim1 eliminated variable 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:39:11,999 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:39:12,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-29 03:39:12,038 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:39:12,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:39:12,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:39:12,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:39:12,173 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:39:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:39:12,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:39:12,374 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_454 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_455) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_454) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_455 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_455) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-11-29 03:39:12,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:12,385 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 37 treesize of output 38 [2023-11-29 03:39:12,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:12,394 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 29 treesize of output 30 [2023-11-29 03:39:12,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:12,405 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 52 treesize of output 55 [2023-11-29 03:39:12,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:12,420 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 82 treesize of output 81 [2023-11-29 03:39:12,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 11 treesize of output 9 [2023-11-29 03:39:12,457 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:39:12,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:12,466 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 18 treesize of output 19 [2023-11-29 03:39:12,468 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:39:12,472 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 03:39:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:39:12,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894403938] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:39:12,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:39:12,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2023-11-29 03:39:12,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371830498] [2023-11-29 03:39:12,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:39:12,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 03:39:12,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:12,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 03:39:12,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=459, Unknown=9, NotChecked=44, Total=600 [2023-11-29 03:39:12,582 INFO L87 Difference]: Start difference. First operand 148 states and 195 transitions. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 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:39:13,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:13,592 INFO L93 Difference]: Finished difference Result 191 states and 223 transitions. [2023-11-29 03:39:13,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 03:39:13,592 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 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:39:13,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:13,593 INFO L225 Difference]: With dead ends: 191 [2023-11-29 03:39:13,593 INFO L226 Difference]: Without dead ends: 191 [2023-11-29 03:39:13,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=284, Invalid=1117, Unknown=9, NotChecked=72, Total=1482 [2023-11-29 03:39:13,595 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 373 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:13,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 402 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1015 Invalid, 0 Unknown, 191 Unchecked, 0.7s Time] [2023-11-29 03:39:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-11-29 03:39:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 148. [2023-11-29 03:39:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 147 states have internal predecessors, (189), 0 states have call successors, (0), 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:39:13,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 189 transitions. [2023-11-29 03:39:13,600 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 189 transitions. Word has length 18 [2023-11-29 03:39:13,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:13,600 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 189 transitions. [2023-11-29 03:39:13,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 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:39:13,601 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 189 transitions. [2023-11-29 03:39:13,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:39:13,601 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:13,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:39:13,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 03:39:13,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:39:13,802 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:13,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:13,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1626106852, now seen corresponding path program 1 times [2023-11-29 03:39:13,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:13,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357763720] [2023-11-29 03:39:13,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:13,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:14,071 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:39:14,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:14,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357763720] [2023-11-29 03:39:14,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357763720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:39:14,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:39:14,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 03:39:14,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486430453] [2023-11-29 03:39:14,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:39:14,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:39:14,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:14,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:39:14,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:39:14,074 INFO L87 Difference]: Start difference. First operand 148 states and 189 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:39:14,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:14,316 INFO L93 Difference]: Finished difference Result 170 states and 210 transitions. [2023-11-29 03:39:14,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:39:14,316 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 03:39:14,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:14,317 INFO L225 Difference]: With dead ends: 170 [2023-11-29 03:39:14,317 INFO L226 Difference]: Without dead ends: 170 [2023-11-29 03:39:14,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:39:14,318 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 53 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:14,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 150 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:39:14,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-29 03:39:14,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 164. [2023-11-29 03:39:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 148 states have (on average 1.3918918918918919) internal successors, (206), 163 states have internal predecessors, (206), 0 states have call successors, (0), 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:39:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 206 transitions. [2023-11-29 03:39:14,323 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 206 transitions. Word has length 19 [2023-11-29 03:39:14,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:14,323 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 206 transitions. [2023-11-29 03:39:14,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:39:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2023-11-29 03:39:14,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:39:14,324 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:14,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:39:14,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 03:39:14,325 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:14,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:14,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1288229249, now seen corresponding path program 1 times [2023-11-29 03:39:14,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:14,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211045103] [2023-11-29 03:39:14,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:14,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:14,542 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:39:14,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:14,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211045103] [2023-11-29 03:39:14,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211045103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:39:14,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:39:14,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 03:39:14,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632319035] [2023-11-29 03:39:14,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:39:14,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:39:14,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:14,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:39:14,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:39:14,544 INFO L87 Difference]: Start difference. First operand 164 states and 206 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:39:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:14,842 INFO L93 Difference]: Finished difference Result 198 states and 241 transitions. [2023-11-29 03:39:14,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:39:14,843 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 03:39:14,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:14,844 INFO L225 Difference]: With dead ends: 198 [2023-11-29 03:39:14,844 INFO L226 Difference]: Without dead ends: 198 [2023-11-29 03:39:14,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2023-11-29 03:39:14,845 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 115 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:14,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 173 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:39:14,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-11-29 03:39:14,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 173. [2023-11-29 03:39:14,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 157 states have (on average 1.3694267515923566) internal successors, (215), 172 states have internal predecessors, (215), 0 states have call successors, (0), 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:39:14,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 215 transitions. [2023-11-29 03:39:14,850 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 215 transitions. Word has length 19 [2023-11-29 03:39:14,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:14,850 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 215 transitions. [2023-11-29 03:39:14,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:39:14,851 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 215 transitions. [2023-11-29 03:39:14,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:39:14,851 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:14,851 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:39:14,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 03:39:14,852 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:14,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:14,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1289095528, now seen corresponding path program 1 times [2023-11-29 03:39:14,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:14,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669880243] [2023-11-29 03:39:14,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:14,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:15,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:39:15,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:15,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669880243] [2023-11-29 03:39:15,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669880243] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:39:15,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150847651] [2023-11-29 03:39:15,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:15,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:39:15,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:39:15,151 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:39:15,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 03:39:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:15,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-29 03:39:15,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:39:15,269 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:39:15,286 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:39:15,292 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:39:15,322 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:39:15,329 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:39:15,373 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:39:15,373 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:39:15,401 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:39:15,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 03:39:15,426 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 22 [2023-11-29 03:39:15,435 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 27 treesize of output 15 [2023-11-29 03:39:15,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:39:15,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:39:15,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:15,785 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 13 treesize of output 17 [2023-11-29 03:39:15,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:15,793 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 13 treesize of output 17 [2023-11-29 03:39:16,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:16,100 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 18 treesize of output 19 [2023-11-29 03:39:16,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-11-29 03:39:16,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:16,110 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 12 treesize of output 16 [2023-11-29 03:39:16,122 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:39:16,122 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 18 treesize of output 1 [2023-11-29 03:39:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:39:16,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150847651] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:39:16,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:39:16,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 20 [2023-11-29 03:39:16,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454558542] [2023-11-29 03:39:16,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:39:16,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 03:39:16,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:16,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 03:39:16,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=321, Unknown=1, NotChecked=0, Total=380 [2023-11-29 03:39:16,150 INFO L87 Difference]: Start difference. First operand 173 states and 215 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 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:39:16,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:16,902 INFO L93 Difference]: Finished difference Result 200 states and 238 transitions. [2023-11-29 03:39:16,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 03:39:16,902 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 03:39:16,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:16,904 INFO L225 Difference]: With dead ends: 200 [2023-11-29 03:39:16,904 INFO L226 Difference]: Without dead ends: 200 [2023-11-29 03:39:16,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=729, Unknown=1, NotChecked=0, Total=870 [2023-11-29 03:39:16,905 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 185 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:16,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 353 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:39:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-29 03:39:16,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 184. [2023-11-29 03:39:16,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 168 states have (on average 1.3630952380952381) internal successors, (229), 183 states have internal predecessors, (229), 0 states have call successors, (0), 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:39:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 229 transitions. [2023-11-29 03:39:16,910 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 229 transitions. Word has length 19 [2023-11-29 03:39:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:16,910 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 229 transitions. [2023-11-29 03:39:16,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 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:39:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 229 transitions. [2023-11-29 03:39:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 03:39:16,911 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:16,911 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:39:16,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 03:39:17,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:39:17,112 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:17,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:17,112 INFO L85 PathProgramCache]: Analyzing trace with hash 436286981, now seen corresponding path program 2 times [2023-11-29 03:39:17,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:17,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487012442] [2023-11-29 03:39:17,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:17,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:39:17,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:17,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487012442] [2023-11-29 03:39:17,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487012442] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:39:17,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836724032] [2023-11-29 03:39:17,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:39:17,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:39:17,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:39:17,466 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:39:17,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 03:39:17,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:39:17,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:39:17,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 03:39:17,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:39:17,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:39:17,656 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:39:17,657 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:39:17,689 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:39:17,692 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:39:17,755 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:39:17,755 INFO L378 Elim1Store]: Elim1 eliminated variable 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:39:17,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:39:17,764 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:39:17,782 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-11-29 03:39:17,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2023-11-29 03:39:17,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-11-29 03:39:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:39:17,962 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:39:18,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:18,040 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 33 treesize of output 37 [2023-11-29 03:39:18,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:18,045 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 30 treesize of output 31 [2023-11-29 03:39:18,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:18,058 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 33 treesize of output 34 [2023-11-29 03:39:18,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:18,063 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:39:18,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:18,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2023-11-29 03:39:18,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:18,279 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 40 treesize of output 33 [2023-11-29 03:39:18,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:18,290 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 58 treesize of output 61 [2023-11-29 03:39:18,471 INFO L349 Elim1Store]: treesize reduction 30, result has 83.9 percent of original size [2023-11-29 03:39:18,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 174 treesize of output 285 [2023-11-29 03:39:18,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:18,507 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 111 treesize of output 101 [2023-11-29 03:39:18,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:18,568 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 126 treesize of output 158 [2023-11-29 03:39:24,747 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:39:24,747 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 48 treesize of output 1 [2023-11-29 03:39:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:39:24,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836724032] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:39:24,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:39:24,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 24 [2023-11-29 03:39:24,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312288635] [2023-11-29 03:39:24,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:39:24,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 03:39:24,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:24,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 03:39:24,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=459, Unknown=23, NotChecked=0, Total=552 [2023-11-29 03:39:24,822 INFO L87 Difference]: Start difference. First operand 184 states and 229 transitions. Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 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:39:25,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:25,767 INFO L93 Difference]: Finished difference Result 218 states and 257 transitions. [2023-11-29 03:39:25,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 03:39:25,767 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 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 22 [2023-11-29 03:39:25,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:25,768 INFO L225 Difference]: With dead ends: 218 [2023-11-29 03:39:25,769 INFO L226 Difference]: Without dead ends: 218 [2023-11-29 03:39:25,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=803, Unknown=25, NotChecked=0, Total=992 [2023-11-29 03:39:25,770 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 417 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:25,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 492 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 03:39:25,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-11-29 03:39:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 183. [2023-11-29 03:39:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 167 states have (on average 1.3532934131736527) internal successors, (226), 182 states have internal predecessors, (226), 0 states have call successors, (0), 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:39:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 226 transitions. [2023-11-29 03:39:25,776 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 226 transitions. Word has length 22 [2023-11-29 03:39:25,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:25,776 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 226 transitions. [2023-11-29 03:39:25,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 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:39:25,776 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 226 transitions. [2023-11-29 03:39:25,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 03:39:25,777 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:25,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:39:25,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 03:39:25,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 03:39:25,980 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:25,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:25,981 INFO L85 PathProgramCache]: Analyzing trace with hash -93883673, now seen corresponding path program 1 times [2023-11-29 03:39:25,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:25,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139181918] [2023-11-29 03:39:25,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:25,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:26,042 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:39:26,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:26,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139181918] [2023-11-29 03:39:26,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139181918] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:39:26,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:39:26,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:39:26,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545762856] [2023-11-29 03:39:26,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:39:26,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:39:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:26,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:39:26,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:39:26,045 INFO L87 Difference]: Start difference. First operand 183 states and 226 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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:39:26,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:26,123 INFO L93 Difference]: Finished difference Result 186 states and 226 transitions. [2023-11-29 03:39:26,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:39:26,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2023-11-29 03:39:26,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:26,125 INFO L225 Difference]: With dead ends: 186 [2023-11-29 03:39:26,125 INFO L226 Difference]: Without dead ends: 186 [2023-11-29 03:39:26,125 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:39:26,126 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 67 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:26,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 59 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:39:26,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-11-29 03:39:26,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2023-11-29 03:39:26,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 169 states have (on average 1.331360946745562) internal successors, (225), 184 states have internal predecessors, (225), 0 states have call successors, (0), 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:39:26,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 225 transitions. [2023-11-29 03:39:26,131 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 225 transitions. Word has length 23 [2023-11-29 03:39:26,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:26,131 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 225 transitions. [2023-11-29 03:39:26,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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:39:26,131 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 225 transitions. [2023-11-29 03:39:26,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 03:39:26,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:26,132 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:39:26,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 03:39:26,133 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:26,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:26,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1859980915, now seen corresponding path program 3 times [2023-11-29 03:39:26,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:26,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349382915] [2023-11-29 03:39:26,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:26,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:39:26,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:26,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349382915] [2023-11-29 03:39:26,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349382915] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:39:26,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078464110] [2023-11-29 03:39:26,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 03:39:26,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:39:26,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:39:26,557 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:39:26,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 03:39:26,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 03:39:26,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:39:26,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 03:39:26,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:39:26,752 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:39:26,806 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:39:26,806 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:39:26,839 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:39:26,897 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:39:26,897 INFO L378 Elim1Store]: Elim1 eliminated variable 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:39:26,915 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:39:26,915 INFO L378 Elim1Store]: Elim1 eliminated variable 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:39:26,939 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:39:26,940 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:39:26,985 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-11-29 03:39:26,985 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:39:27,085 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:39:27,085 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:39:27,095 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:39:27,171 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:39:27,171 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:39:27,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:39:27,267 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:39:27,268 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:39:27,283 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_813 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2023-11-29 03:39:27,348 INFO L349 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2023-11-29 03:39:27,348 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 27 treesize of output 26 [2023-11-29 03:39:27,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:27,451 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 16 treesize of output 20 [2023-11-29 03:39:27,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:27,557 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:39:27,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:27,566 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 68 treesize of output 71 [2023-11-29 03:39:27,572 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 56 treesize of output 52 [2023-11-29 03:39:27,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:27,581 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 60 treesize of output 56 [2023-11-29 03:39:27,592 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 03:39:27,592 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:39:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 03:39:27,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078464110] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:39:27,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:39:27,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2023-11-29 03:39:27,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943806369] [2023-11-29 03:39:27,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:39:27,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-29 03:39:27,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:27,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 03:39:27,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=780, Unknown=26, NotChecked=58, Total=992 [2023-11-29 03:39:27,724 INFO L87 Difference]: Start difference. First operand 185 states and 225 transitions. Second operand has 32 states, 31 states have (on average 2.0) internal successors, (62), 32 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:39:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:29,065 INFO L93 Difference]: Finished difference Result 305 states and 354 transitions. [2023-11-29 03:39:29,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 03:39:29,065 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.0) internal successors, (62), 32 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-29 03:39:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:29,067 INFO L225 Difference]: With dead ends: 305 [2023-11-29 03:39:29,067 INFO L226 Difference]: Without dead ends: 305 [2023-11-29 03:39:29,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=418, Invalid=2103, Unknown=33, NotChecked=98, Total=2652 [2023-11-29 03:39:29,068 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 450 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 240 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:29,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 571 Invalid, 1903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1506 Invalid, 0 Unknown, 240 Unchecked, 0.9s Time] [2023-11-29 03:39:29,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-11-29 03:39:29,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 228. [2023-11-29 03:39:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 212 states have (on average 1.3773584905660377) internal successors, (292), 227 states have internal predecessors, (292), 0 states have call successors, (0), 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:39:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 292 transitions. [2023-11-29 03:39:29,073 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 292 transitions. Word has length 24 [2023-11-29 03:39:29,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:29,073 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 292 transitions. [2023-11-29 03:39:29,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.0) internal successors, (62), 32 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:39:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 292 transitions. [2023-11-29 03:39:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 03:39:29,074 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:29,074 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:39:29,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 03:39:29,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:39:29,274 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:29,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:29,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1859980916, now seen corresponding path program 2 times [2023-11-29 03:39:29,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:29,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376023639] [2023-11-29 03:39:29,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:29,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:39:29,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:29,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376023639] [2023-11-29 03:39:29,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376023639] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:39:29,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626658672] [2023-11-29 03:39:29,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:39:29,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:39:29,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:39:29,881 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:39:29,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 03:39:29,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:39:29,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:39:29,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 03:39:29,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:39:29,999 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:39:30,054 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 03:39:30,055 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:39:30,098 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:39:30,107 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:39:30,180 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:39:30,180 INFO L378 Elim1Store]: Elim1 eliminated variable 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:39:30,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:39:30,189 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:39:30,237 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:39:30,237 INFO L378 Elim1Store]: Elim1 eliminated variable 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:39:30,256 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:39:30,256 INFO L378 Elim1Store]: Elim1 eliminated variable 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:39:30,333 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-29 03:39:30,333 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:39:30,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 03:39:30,392 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-11-29 03:39:30,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 23 [2023-11-29 03:39:30,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:39:30,405 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:39:30,514 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 03:39:30,515 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:39:30,534 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:39:30,535 INFO L378 Elim1Store]: Elim1 eliminated variable 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:39:30,596 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 03:39:30,596 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:39:30,601 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:39:30,813 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 03:39:30,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 26 [2023-11-29 03:39:30,818 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:39:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:39:30,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:39:30,966 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_938 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_939 (Array Int Int)) (v_ArrVal_938 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_939) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-11-29 03:39:30,980 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_939 (Array Int Int)) (v_ArrVal_938 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_939) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_938 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-11-29 03:39:30,995 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_934 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_938 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_934) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_939) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_934 (Array Int Int)) (v_ArrVal_938 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_934) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-11-29 03:39:31,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:31,130 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 33 treesize of output 37 [2023-11-29 03:39:31,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:31,244 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 123 treesize of output 127 [2023-11-29 03:39:31,303 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:39:31,341 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_26| Int) (v_ArrVal_934 (Array Int Int)) (v_ArrVal_938 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_934) |v_ULTIMATE.start_main_#t~malloc3#1.base_26| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_26|) 0)))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_18 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (forall ((v_ArrVal_939 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_18) .cse0 v_ArrVal_939) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))))) (< |ULTIMATE.start_main_~x~0#1.offset| 0))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (forall ((v_arrayElimArr_18 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_18 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse1) 0)) (forall ((v_ArrVal_939 (Array Int Int))) (not (= .cse1 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_18) .cse1 v_ArrVal_939) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (< |ULTIMATE.start_main_~x~0#1.offset| 0))) (forall ((v_prenex_5 (Array Int Int)) (v_arrayElimCell_105 Int) (v_prenex_6 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_5) v_arrayElimCell_105 v_prenex_6) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 5) (not (= (select |c_#valid| v_arrayElimCell_105) 0))))) is different from false [2023-11-29 03:39:31,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:31,560 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:39:31,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:31,570 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 81 treesize of output 84 [2023-11-29 03:39:31,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:31,581 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 77 treesize of output 65 [2023-11-29 03:39:31,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 50 treesize of output 46 [2023-11-29 03:39:31,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:31,652 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:39:31,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:31,661 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 122 treesize of output 121 [2023-11-29 03:39:31,667 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 20 [2023-11-29 03:39:31,671 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 23 treesize of output 21 [2023-11-29 03:39:31,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:31,712 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:39:31,716 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:39:31,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:31,724 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 37 [2023-11-29 03:39:31,730 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:39:31,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:31,752 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:39:31,755 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:39:31,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:31,763 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 33 [2023-11-29 03:39:31,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:31,771 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:39:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-29 03:39:32,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626658672] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:39:32,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:39:32,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 38 [2023-11-29 03:39:32,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336262192] [2023-11-29 03:39:32,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:39:32,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 03:39:32,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:32,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 03:39:32,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1045, Unknown=7, NotChecked=276, Total=1482 [2023-11-29 03:39:32,450 INFO L87 Difference]: Start difference. First operand 228 states and 292 transitions. Second operand has 39 states, 38 states have (on average 1.894736842105263) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:39:40,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:40,028 INFO L93 Difference]: Finished difference Result 453 states and 525 transitions. [2023-11-29 03:39:40,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-11-29 03:39:40,029 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.894736842105263) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-29 03:39:40,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:40,031 INFO L225 Difference]: With dead ends: 453 [2023-11-29 03:39:40,031 INFO L226 Difference]: Without dead ends: 453 [2023-11-29 03:39:40,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 2128 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1174, Invalid=6663, Unknown=11, NotChecked=708, Total=8556 [2023-11-29 03:39:40,034 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 1165 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 2530 mSolverCounterSat, 394 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 4506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 2530 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 1580 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:40,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1165 Valid, 1021 Invalid, 4506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 2530 Invalid, 2 Unknown, 1580 Unchecked, 3.8s Time] [2023-11-29 03:39:40,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2023-11-29 03:39:40,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 254. [2023-11-29 03:39:40,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 253 states have internal predecessors, (329), 0 states have call successors, (0), 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:39:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 329 transitions. [2023-11-29 03:39:40,041 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 329 transitions. Word has length 24 [2023-11-29 03:39:40,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:40,042 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 329 transitions. [2023-11-29 03:39:40,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.894736842105263) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:39:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 329 transitions. [2023-11-29 03:39:40,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 03:39:40,043 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:40,043 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] [2023-11-29 03:39:40,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 03:39:40,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:39:40,249 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:40,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:40,249 INFO L85 PathProgramCache]: Analyzing trace with hash -93868450, now seen corresponding path program 1 times [2023-11-29 03:39:40,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:40,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523305808] [2023-11-29 03:39:40,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:40,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:40,714 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:39:40,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:40,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523305808] [2023-11-29 03:39:40,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523305808] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:39:40,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695046328] [2023-11-29 03:39:40,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:40,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:39:40,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:39:40,715 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:39:40,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 03:39:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:40,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-29 03:39:40,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:39:40,855 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:39:40,875 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:39:40,923 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:39:40,923 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:39:40,954 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:39:40,960 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:39:40,993 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:39:41,021 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:39:41,032 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:39:41,091 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:39:41,091 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:39:41,118 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:39:41,128 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 20 treesize of output 15 [2023-11-29 03:39:41,132 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:39:41,137 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:39:41,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 27 treesize of output 15 [2023-11-29 03:39:41,218 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:39:41,242 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:39:41,243 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:39:41,495 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 03:39:41,495 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:39:41,651 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:39:41,653 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 43 treesize of output 41 [2023-11-29 03:39:41,656 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:39:41,687 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:39:41,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695046328] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:39:41,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:39:41,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2023-11-29 03:39:41,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000134596] [2023-11-29 03:39:41,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:39:41,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-29 03:39:41,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:41,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 03:39:41,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=941, Unknown=27, NotChecked=0, Total=1122 [2023-11-29 03:39:41,690 INFO L87 Difference]: Start difference. First operand 254 states and 329 transitions. Second operand has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 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:39:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:42,591 INFO L93 Difference]: Finished difference Result 299 states and 371 transitions. [2023-11-29 03:39:42,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 03:39:42,594 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 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:39:42,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:42,595 INFO L225 Difference]: With dead ends: 299 [2023-11-29 03:39:42,595 INFO L226 Difference]: Without dead ends: 299 [2023-11-29 03:39:42,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=294, Invalid=1651, Unknown=35, NotChecked=0, Total=1980 [2023-11-29 03:39:42,597 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 254 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:42,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 407 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 03:39:42,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-29 03:39:42,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 263. [2023-11-29 03:39:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 247 states have (on average 1.368421052631579) internal successors, (338), 262 states have internal predecessors, (338), 0 states have call successors, (0), 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:39:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 338 transitions. [2023-11-29 03:39:42,602 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 338 transitions. Word has length 25 [2023-11-29 03:39:42,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:42,602 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 338 transitions. [2023-11-29 03:39:42,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 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:39:42,603 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 338 transitions. [2023-11-29 03:39:42,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 03:39:42,603 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:42,603 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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:39:42,609 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 03:39:42,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:39:42,804 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:42,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:42,804 INFO L85 PathProgramCache]: Analyzing trace with hash -93002171, now seen corresponding path program 1 times [2023-11-29 03:39:42,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:42,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283585040] [2023-11-29 03:39:42,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:42,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:43,282 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:39:43,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:43,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283585040] [2023-11-29 03:39:43,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283585040] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:39:43,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610530249] [2023-11-29 03:39:43,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:43,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:39:43,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:39:43,284 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:39:43,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 03:39:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:43,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-29 03:39:43,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:39:43,428 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:39:43,488 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 03:39:43,488 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:39:43,522 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:39:43,597 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:39:43,598 INFO L378 Elim1Store]: Elim1 eliminated variable 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:39:43,613 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:39:43,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 03:39:43,671 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2023-11-29 03:39:43,672 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:39:43,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-29 03:39:43,732 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:39:43,740 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 57 treesize of output 29 [2023-11-29 03:39:43,846 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 7 treesize of output 3 [2023-11-29 03:39:43,926 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:39:43,926 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 62 treesize of output 29 [2023-11-29 03:39:43,955 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:39:43,955 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:39:43,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:43,987 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 15 treesize of output 19 [2023-11-29 03:39:43,992 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_23 (Array Int Int))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_23 |c_ULTIMATE.start_main_~x~0#1.offset|))))) is different from false [2023-11-29 03:39:44,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:44,221 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:39:44,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:44,233 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 162 treesize of output 161 [2023-11-29 03:39:44,241 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 33 treesize of output 31 [2023-11-29 03:39:44,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:44,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2023-11-29 03:39:47,906 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:39:47,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610530249] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:39:47,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:39:47,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 33 [2023-11-29 03:39:47,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672047228] [2023-11-29 03:39:47,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:39:47,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-29 03:39:47,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:47,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 03:39:47,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=883, Unknown=7, NotChecked=62, Total=1122 [2023-11-29 03:39:47,908 INFO L87 Difference]: Start difference. First operand 263 states and 338 transitions. Second operand has 34 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 34 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:39:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:39:50,873 INFO L93 Difference]: Finished difference Result 377 states and 455 transitions. [2023-11-29 03:39:50,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-29 03:39:50,874 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 34 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-29 03:39:50,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:39:50,876 INFO L225 Difference]: With dead ends: 377 [2023-11-29 03:39:50,876 INFO L226 Difference]: Without dead ends: 377 [2023-11-29 03:39:50,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=534, Invalid=2433, Unknown=7, NotChecked=106, Total=3080 [2023-11-29 03:39:50,877 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 599 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:39:50,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 653 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1681 Invalid, 0 Unknown, 259 Unchecked, 1.7s Time] [2023-11-29 03:39:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-11-29 03:39:50,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 283. [2023-11-29 03:39:50,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 267 states have (on average 1.3782771535580525) internal successors, (368), 282 states have internal predecessors, (368), 0 states have call successors, (0), 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:39:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 368 transitions. [2023-11-29 03:39:50,882 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 368 transitions. Word has length 25 [2023-11-29 03:39:50,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:39:50,882 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 368 transitions. [2023-11-29 03:39:50,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 34 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:39:50,882 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 368 transitions. [2023-11-29 03:39:50,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 03:39:50,883 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:39:50,883 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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:39:50,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 03:39:51,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-29 03:39:51,084 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:39:51,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:39:51,084 INFO L85 PathProgramCache]: Analyzing trace with hash -93002170, now seen corresponding path program 1 times [2023-11-29 03:39:51,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:39:51,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267242365] [2023-11-29 03:39:51,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:51,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:39:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:51,755 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:39:51,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:39:51,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267242365] [2023-11-29 03:39:51,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267242365] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:39:51,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267588461] [2023-11-29 03:39:51,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:51,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:39:51,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:39:51,756 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:39:51,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 03:39:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:39:51,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 03:39:51,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:39:51,870 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:39:51,933 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 03:39:51,933 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:39:51,948 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:39:51,995 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:39:52,006 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:39:52,114 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:39:52,114 INFO L378 Elim1Store]: Elim1 eliminated variable 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:39:52,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:39:52,130 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:39:52,150 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:39:52,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2023-11-29 03:39:52,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:39:52,242 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-29 03:39:52,242 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:39:52,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2023-11-29 03:39:52,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-29 03:39:52,300 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:39:52,313 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 22 [2023-11-29 03:39:52,320 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 57 treesize of output 29 [2023-11-29 03:39:52,533 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:39:52,533 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 64 treesize of output 31 [2023-11-29 03:39:52,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2023-11-29 03:39:52,541 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:39:52,541 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:39:52,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:52,719 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:39:52,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:52,723 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 24 treesize of output 28 [2023-11-29 03:39:52,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:52,734 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 15 treesize of output 19 [2023-11-29 03:39:53,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:53,383 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 46 treesize of output 47 [2023-11-29 03:39:53,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:53,389 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 38 treesize of output 39 [2023-11-29 03:39:53,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:53,400 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 258 treesize of output 257 [2023-11-29 03:39:53,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:53,418 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 382 treesize of output 373 [2023-11-29 03:39:53,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 39 treesize of output 37 [2023-11-29 03:39:53,437 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 37 treesize of output 35 [2023-11-29 03:39:53,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:53,450 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 49 treesize of output 51 [2023-11-29 03:39:53,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:53,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 47 [2023-11-29 03:39:53,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:53,628 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:39:53,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:53,637 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 138 treesize of output 137 [2023-11-29 03:39:53,645 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 27 treesize of output 25 [2023-11-29 03:39:53,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:39:53,655 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 35 treesize of output 37 [2023-11-29 03:39:53,916 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 391 treesize of output 383 [2023-11-29 03:39:56,755 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:39:56,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267588461] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:39:56,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:39:56,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 34 [2023-11-29 03:39:56,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240050578] [2023-11-29 03:39:56,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:39:56,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-29 03:39:56,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:39:56,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-29 03:39:56,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1111, Unknown=5, NotChecked=0, Total=1260 [2023-11-29 03:39:56,758 INFO L87 Difference]: Start difference. First operand 283 states and 368 transitions. Second operand has 36 states, 35 states have (on average 2.085714285714286) internal successors, (73), 35 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:39:58,973 WARN L854 $PredicateComparison]: unable to prove that (and (<= 8 (select |c_#length| |c_ULTIMATE.start_main_~x~0#1.base|)) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (forall ((v_arrayElimArr_27 (Array Int Int))) (or (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_27) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_27 |c_ULTIMATE.start_main_~x~0#1.offset|))))) (forall ((v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|)) (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_26) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_26 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) is different from false [2023-11-29 03:40:05,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:40:05,457 INFO L93 Difference]: Finished difference Result 376 states and 454 transitions. [2023-11-29 03:40:05,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-29 03:40:05,458 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.085714285714286) internal successors, (73), 35 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 25 [2023-11-29 03:40:05,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:40:05,459 INFO L225 Difference]: With dead ends: 376 [2023-11-29 03:40:05,459 INFO L226 Difference]: Without dead ends: 376 [2023-11-29 03:40:05,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=621, Invalid=3534, Unknown=9, NotChecked=126, Total=4290 [2023-11-29 03:40:05,461 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 986 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 285 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 2171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:40:05,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 670 Invalid, 2171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1780 Invalid, 1 Unknown, 105 Unchecked, 2.5s Time] [2023-11-29 03:40:05,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2023-11-29 03:40:05,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 285. [2023-11-29 03:40:05,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 269 states have (on average 1.3754646840148699) internal successors, (370), 284 states have internal predecessors, (370), 0 states have call successors, (0), 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:40:05,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 370 transitions. [2023-11-29 03:40:05,466 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 370 transitions. Word has length 25 [2023-11-29 03:40:05,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:40:05,466 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 370 transitions. [2023-11-29 03:40:05,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.085714285714286) internal successors, (73), 35 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:40:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 370 transitions. [2023-11-29 03:40:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 03:40:05,467 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:40:05,467 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] [2023-11-29 03:40:05,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 03:40:05,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:40:05,667 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:40:05,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:40:05,668 INFO L85 PathProgramCache]: Analyzing trace with hash 17723053, now seen corresponding path program 1 times [2023-11-29 03:40:05,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:40:05,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501037448] [2023-11-29 03:40:05,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:40:05,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:40:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:40:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:40:05,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:40:05,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501037448] [2023-11-29 03:40:05,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501037448] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:40:05,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103565544] [2023-11-29 03:40:05,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:40:05,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:40:05,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:40:05,971 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:40:05,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 03:40:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:40:06,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 03:40:06,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:40:06,084 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:40:06,108 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:40:06,109 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:40:06,133 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:40:06,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:40:06,314 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 25 treesize of output 21 [2023-11-29 03:40:06,385 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:40:06,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:40:06,389 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:40:06,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:40:06,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 25 treesize of output 29 [2023-11-29 03:40:06,611 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 11 treesize of output 9 [2023-11-29 03:40:06,613 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 20 treesize of output 18 [2023-11-29 03:40:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:40:06,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103565544] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:40:06,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:40:06,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2023-11-29 03:40:06,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782084316] [2023-11-29 03:40:06,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:40:06,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 03:40:06,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:40:06,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 03:40:06,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-11-29 03:40:06,655 INFO L87 Difference]: Start difference. First operand 285 states and 370 transitions. Second operand has 26 states, 25 states have (on average 2.36) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:40:07,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:40:07,358 INFO L93 Difference]: Finished difference Result 302 states and 381 transitions. [2023-11-29 03:40:07,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:40:07,358 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.36) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 03:40:07,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:40:07,359 INFO L225 Difference]: With dead ends: 302 [2023-11-29 03:40:07,360 INFO L226 Difference]: Without dead ends: 302 [2023-11-29 03:40:07,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2023-11-29 03:40:07,360 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 205 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:40:07,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 275 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:40:07,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-11-29 03:40:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 285. [2023-11-29 03:40:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 269 states have (on average 1.3717472118959109) internal successors, (369), 284 states have internal predecessors, (369), 0 states have call successors, (0), 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:40:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 369 transitions. [2023-11-29 03:40:07,367 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 369 transitions. Word has length 26 [2023-11-29 03:40:07,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:40:07,368 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 369 transitions. [2023-11-29 03:40:07,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.36) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:40:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 369 transitions. [2023-11-29 03:40:07,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 03:40:07,368 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:40:07,368 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] [2023-11-29 03:40:07,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 03:40:07,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-29 03:40:07,569 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:40:07,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:40:07,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1106522595, now seen corresponding path program 1 times [2023-11-29 03:40:07,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:40:07,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8634869] [2023-11-29 03:40:07,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:40:07,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:40:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:40:07,936 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:40:07,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:40:07,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8634869] [2023-11-29 03:40:07,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8634869] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:40:07,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671800400] [2023-11-29 03:40:07,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:40:07,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:40:07,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:40:07,937 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:40:07,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 03:40:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:40:08,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-29 03:40:08,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:40:08,085 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:40:08,167 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 03:40:08,167 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:40:08,216 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:40:08,303 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:40:08,303 INFO L378 Elim1Store]: Elim1 eliminated variable 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:40:08,329 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:40:08,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 03:40:08,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:40:08,523 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-29 03:40:08,523 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 24 treesize of output 28 [2023-11-29 03:40:08,598 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:40:08,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:40:08,692 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:40:08,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:40:08,706 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 32 treesize of output 28 [2023-11-29 03:40:09,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:40:09,292 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:40:09,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:40:09,300 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 40 treesize of output 43 [2023-11-29 03:40:09,305 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 14 treesize of output 12 [2023-11-29 03:40:09,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:40:09,433 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:40:09,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:40:09,444 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 40 treesize of output 43 [2023-11-29 03:40:09,450 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 14 treesize of output 12 [2023-11-29 03:40:10,621 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:40:10,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671800400] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:40:10,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:40:10,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 28 [2023-11-29 03:40:10,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114506949] [2023-11-29 03:40:10,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:40:10,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 03:40:10,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:40:10,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 03:40:10,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=666, Unknown=4, NotChecked=0, Total=812 [2023-11-29 03:40:10,623 INFO L87 Difference]: Start difference. First operand 285 states and 369 transitions. Second operand has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 29 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:40:13,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:40:13,048 INFO L93 Difference]: Finished difference Result 401 states and 493 transitions. [2023-11-29 03:40:13,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 03:40:13,049 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 29 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 03:40:13,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:40:13,050 INFO L225 Difference]: With dead ends: 401 [2023-11-29 03:40:13,050 INFO L226 Difference]: Without dead ends: 401 [2023-11-29 03:40:13,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=401, Invalid=1665, Unknown=4, NotChecked=0, Total=2070 [2023-11-29 03:40:13,051 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 486 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:40:13,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 508 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 03:40:13,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2023-11-29 03:40:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 304. [2023-11-29 03:40:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 288 states have (on average 1.3715277777777777) internal successors, (395), 303 states have internal predecessors, (395), 0 states have call successors, (0), 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:40:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 395 transitions. [2023-11-29 03:40:13,056 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 395 transitions. Word has length 26 [2023-11-29 03:40:13,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:40:13,056 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 395 transitions. [2023-11-29 03:40:13,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 29 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:40:13,057 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 395 transitions. [2023-11-29 03:40:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 03:40:13,057 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:40:13,057 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] [2023-11-29 03:40:13,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-29 03:40:13,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-29 03:40:13,258 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:40:13,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:40:13,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1106522594, now seen corresponding path program 1 times [2023-11-29 03:40:13,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:40:13,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622122646] [2023-11-29 03:40:13,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:40:13,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:40:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:40:13,879 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:40:13,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:40:13,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622122646] [2023-11-29 03:40:13,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622122646] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:40:13,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879268570] [2023-11-29 03:40:13,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:40:13,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:40:13,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:40:13,881 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:40:13,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 03:40:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:40:13,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 03:40:14,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:40:14,005 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:40:14,089 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:40:14,107 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 03:40:14,107 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:40:14,159 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:40:14,168 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:40:14,298 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:40:14,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 03:40:14,322 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:40:14,322 INFO L378 Elim1Store]: Elim1 eliminated variable 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:40:14,380 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:40:14,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2023-11-29 03:40:14,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:40:14,609 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 7 treesize of output 3 [2023-11-29 03:40:14,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-11-29 03:40:14,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:40:14,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 03:40:14,644 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-29 03:40:14,644 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:40:14,712 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:40:14,715 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:40:14,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:40:14,811 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:40:14,817 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:40:14,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:40:14,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-11-29 03:40:14,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:40:14,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:40:14,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:40:14,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:40:15,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:40:15,524 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 40 treesize of output 41 [2023-11-29 03:40:15,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:40:15,531 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 32 treesize of output 33 [2023-11-29 03:40:15,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:40:15,544 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 58 treesize of output 61 [2023-11-29 03:40:15,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:40:15,563 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 94 treesize of output 93 [2023-11-29 03:40:15,570 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 18 treesize of output 16 [2023-11-29 03:40:15,576 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 14 [2023-11-29 03:40:15,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:40:15,648 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 20 treesize of output 21 [2023-11-29 03:40:15,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:40:15,656 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 37 [2023-11-29 03:40:15,671 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 5 [2023-11-29 03:40:15,984 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:40:15,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879268570] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:40:15,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:40:15,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 32 [2023-11-29 03:40:15,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250105634] [2023-11-29 03:40:15,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:40:15,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 03:40:15,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:40:15,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 03:40:15,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=895, Unknown=4, NotChecked=0, Total=1056 [2023-11-29 03:40:15,986 INFO L87 Difference]: Start difference. First operand 304 states and 395 transitions. Second operand has 33 states, 32 states have (on average 2.375) internal successors, (76), 33 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:40:18,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:40:18,087 INFO L93 Difference]: Finished difference Result 398 states and 489 transitions. [2023-11-29 03:40:18,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 03:40:18,088 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.375) internal successors, (76), 33 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 03:40:18,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:40:18,089 INFO L225 Difference]: With dead ends: 398 [2023-11-29 03:40:18,089 INFO L226 Difference]: Without dead ends: 398 [2023-11-29 03:40:18,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=465, Invalid=2183, Unknown=4, NotChecked=0, Total=2652 [2023-11-29 03:40:18,090 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 404 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:40:18,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 473 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 03:40:18,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2023-11-29 03:40:18,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 292. [2023-11-29 03:40:18,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 276 states have (on average 1.3623188405797102) internal successors, (376), 291 states have internal predecessors, (376), 0 states have call successors, (0), 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:40:18,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 376 transitions. [2023-11-29 03:40:18,095 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 376 transitions. Word has length 26 [2023-11-29 03:40:18,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:40:18,095 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 376 transitions. [2023-11-29 03:40:18,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.375) internal successors, (76), 33 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:40:18,095 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 376 transitions. [2023-11-29 03:40:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 03:40:18,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:40:18,096 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:40:18,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-29 03:40:18,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-29 03:40:18,297 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:40:18,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:40:18,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1032222690, now seen corresponding path program 1 times [2023-11-29 03:40:18,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:40:18,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49065332] [2023-11-29 03:40:18,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:40:18,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:40:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:40:18,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:40:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:40:18,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:40:18,342 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 03:40:18,343 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (44 of 45 remaining) [2023-11-29 03:40:18,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 45 remaining) [2023-11-29 03:40:18,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 45 remaining) [2023-11-29 03:40:18,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 45 remaining) [2023-11-29 03:40:18,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 45 remaining) [2023-11-29 03:40:18,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 45 remaining) [2023-11-29 03:40:18,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 45 remaining) [2023-11-29 03:40:18,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 45 remaining) [2023-11-29 03:40:18,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 45 remaining) [2023-11-29 03:40:18,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 45 remaining) [2023-11-29 03:40:18,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 45 remaining) [2023-11-29 03:40:18,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 45 remaining) [2023-11-29 03:40:18,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 45 remaining) [2023-11-29 03:40:18,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 45 remaining) [2023-11-29 03:40:18,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 45 remaining) [2023-11-29 03:40:18,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 45 remaining) [2023-11-29 03:40:18,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 45 remaining) [2023-11-29 03:40:18,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 45 remaining) [2023-11-29 03:40:18,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 45 remaining) [2023-11-29 03:40:18,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 45 remaining) [2023-11-29 03:40:18,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 45 remaining) [2023-11-29 03:40:18,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 45 remaining) [2023-11-29 03:40:18,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 45 remaining) [2023-11-29 03:40:18,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 45 remaining) [2023-11-29 03:40:18,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 45 remaining) [2023-11-29 03:40:18,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 45 remaining) [2023-11-29 03:40:18,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 45 remaining) [2023-11-29 03:40:18,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 45 remaining) [2023-11-29 03:40:18,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 45 remaining) [2023-11-29 03:40:18,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 45 remaining) [2023-11-29 03:40:18,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 45 remaining) [2023-11-29 03:40:18,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 45 remaining) [2023-11-29 03:40:18,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 45 remaining) [2023-11-29 03:40:18,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 45 remaining) [2023-11-29 03:40:18,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 45 remaining) [2023-11-29 03:40:18,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 45 remaining) [2023-11-29 03:40:18,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 45 remaining) [2023-11-29 03:40:18,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK (7 of 45 remaining) [2023-11-29 03:40:18,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 45 remaining) [2023-11-29 03:40:18,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 45 remaining) [2023-11-29 03:40:18,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 45 remaining) [2023-11-29 03:40:18,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 45 remaining) [2023-11-29 03:40:18,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (2 of 45 remaining) [2023-11-29 03:40:18,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (1 of 45 remaining) [2023-11-29 03:40:18,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (0 of 45 remaining) [2023-11-29 03:40:18,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 03:40:18,350 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 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:40:18,353 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 03:40:18,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 03:40:18 BoogieIcfgContainer [2023-11-29 03:40:18,370 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 03:40:18,370 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 03:40:18,370 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 03:40:18,370 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 03:40:18,371 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:39:02" (3/4) ... [2023-11-29 03:40:18,372 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 03:40:18,373 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 03:40:18,373 INFO L158 Benchmark]: Toolchain (without parser) took 76657.19ms. Allocated memory was 192.9MB in the beginning and 373.3MB in the end (delta: 180.4MB). Free memory was 147.9MB in the beginning and 280.8MB in the end (delta: -132.9MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2023-11-29 03:40:18,374 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 192.9MB. Free memory is still 166.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:40:18,374 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.28ms. Allocated memory is still 192.9MB. Free memory was 147.9MB in the beginning and 130.2MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 03:40:18,374 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.76ms. Allocated memory is still 192.9MB. Free memory was 130.2MB in the beginning and 128.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:40:18,374 INFO L158 Benchmark]: Boogie Preprocessor took 49.84ms. Allocated memory is still 192.9MB. Free memory was 128.1MB in the beginning and 125.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:40:18,374 INFO L158 Benchmark]: RCFGBuilder took 520.49ms. Allocated memory is still 192.9MB. Free memory was 125.3MB in the beginning and 99.8MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 03:40:18,374 INFO L158 Benchmark]: TraceAbstraction took 75664.79ms. Allocated memory was 192.9MB in the beginning and 373.3MB in the end (delta: 180.4MB). Free memory was 99.1MB in the beginning and 280.8MB in the end (delta: -181.7MB). Peak memory consumption was 1.7MB. Max. memory is 16.1GB. [2023-11-29 03:40:18,374 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 373.3MB. Free memory is still 280.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:40:18,375 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.20ms. Allocated memory is still 192.9MB. Free memory is still 166.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.28ms. Allocated memory is still 192.9MB. Free memory was 147.9MB in the beginning and 130.2MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.76ms. Allocated memory is still 192.9MB. Free memory was 130.2MB in the beginning and 128.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.84ms. Allocated memory is still 192.9MB. Free memory was 128.1MB in the beginning and 125.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 520.49ms. Allocated memory is still 192.9MB. Free memory was 125.3MB in the beginning and 99.8MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 75664.79ms. Allocated memory was 192.9MB in the beginning and 373.3MB in the end (delta: 180.4MB). Free memory was 99.1MB in the beginning and 280.8MB in the end (delta: -181.7MB). Peak memory consumption was 1.7MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 373.3MB. Free memory is still 280.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 996. Possible FailurePath: [L999] SLL* head = malloc(sizeof(SLL)); [L1000] head->next = ((void*)0) [L1001] head->data = 0 [L1003] SLL* x = head; VAL [head={-2:0}, x={-2:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1016] COND FALSE !(__VERIFIER_nondet_int()) [L1025] EXPR x = head VAL [head={-2:0}, x={-2:0}] [L1026] EXPR x->next [L1026] COND FALSE, EXPR !(x->next) [L1033] EXPR x->next [L1033] SLL* y = x->next; [L1034] EXPR x->next = malloc(sizeof(SLL)) [L1035] EXPR x->data = 1 [L1036] EXPR x->next = y [L1023-L1037] { x = head; while (x->next) { if (__VERIFIER_nondet_int()) break; x = x->next; } SLL* y = x->next; x->next = malloc(sizeof(SLL)); x->data = 1; x->next = y; } VAL [head={-2:0}, x={-2:0}] [L1040] x = head VAL [head={-2:0}, x={-2:0}] [L1043] EXPR x->data [L1043] COND FALSE !(x->data != 1) [L1049] EXPR x->next [L1049] x = x->next [L1050] COND FALSE !(\read(*x)) VAL [head={-2:0}, x={0:0}] [L1058] x = head VAL [head={-2:0}, x={-2:0}] [L1059] COND TRUE x != ((void*)0) [L1061] head = x VAL [head={-2:0}, x={-2:0}] [L1062] EXPR x->next [L1062] x = x->next [L1063] free(head) VAL [head={-2:0}, x={0:0}] [L1063] free(head) VAL [head={-2:0}, x={0:0}] [L1063] free(head) [L1059] COND FALSE !(x != ((void*)0)) VAL [head={-2:0}, x={0:0}] [L1066] return 0; VAL [\result=0, head={-2:0}, x={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 89 locations, 45 error locations. Started 1 CEGAR loops. OverallTime: 75.6s, OverallIterations: 28, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 34.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 7571 SdHoareTripleChecker+Valid, 18.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7571 mSDsluCounter, 7910 SdHoareTripleChecker+Invalid, 16.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2639 IncrementalHoareTripleChecker+Unchecked, 6780 mSDsCounter, 2119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18111 IncrementalHoareTripleChecker+Invalid, 22872 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2119 mSolverCounterUnsat, 1130 mSDtfsCounter, 18111 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1087 GetRequests, 390 SyntacticMatches, 14 SemanticMatches, 683 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 7719 ImplicationChecksByTransitivity, 28.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=26, InterpolantAutomatonStates: 439, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 1137 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 36.1s InterpolantComputationTime, 795 NumberOfCodeBlocks, 795 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1006 ConstructedInterpolants, 154 QuantifiedInterpolants, 26354 SizeOfPredicates, 136 NumberOfNonLiveVariables, 2836 ConjunctsInSsa, 616 ConjunctsInUnsatCore, 54 InterpolantComputations, 14 PerfectInterpolantSequences, 18/172 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 03:40:18,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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 b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:40:20,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:40:20,303 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 03:40:20,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:40:20,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:40:20,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:40:20,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:40:20,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:40:20,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:40:20,341 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:40:20,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:40:20,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:40:20,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:40:20,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:40:20,344 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:40:20,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:40:20,346 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:40:20,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:40:20,347 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:40:20,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:40:20,348 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:40:20,348 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:40:20,349 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:40:20,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:40:20,350 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:40:20,350 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 03:40:20,351 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 03:40:20,351 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:40:20,351 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:40:20,352 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:40:20,352 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:40:20,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:40:20,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:40:20,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:40:20,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:40:20,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:40:20,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:40:20,354 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 03:40:20,355 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 03:40:20,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:40:20,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:40:20,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:40:20,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:40:20,356 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 03:40:20,356 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_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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 -> b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d [2023-11-29 03:40:20,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:40:20,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:40:20,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:40:20,669 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:40:20,670 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:40:20,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2023-11-29 03:40:23,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:40:23,667 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:40:23,668 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2023-11-29 03:40:23,682 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/data/dbc1cf9f8/270fee0d496b45bb8be4e49dc2783516/FLAG2ba498968 [2023-11-29 03:40:23,694 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/data/dbc1cf9f8/270fee0d496b45bb8be4e49dc2783516 [2023-11-29 03:40:23,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:40:23,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:40:23,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:40:23,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:40:23,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:40:23,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:40:23" (1/1) ... [2023-11-29 03:40:23,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bce8245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:40:23, skipping insertion in model container [2023-11-29 03:40:23,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:40:23" (1/1) ... [2023-11-29 03:40:23,753 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:40:24,023 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:40:24,037 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:40:24,076 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:40:24,104 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:40:24,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:40:24 WrapperNode [2023-11-29 03:40:24,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:40:24,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:40:24,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:40:24,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:40:24,111 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:40:24" (1/1) ... [2023-11-29 03:40:24,129 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:40:24" (1/1) ... [2023-11-29 03:40:24,152 INFO L138 Inliner]: procedures = 122, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 115 [2023-11-29 03:40:24,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:40:24,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:40:24,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:40:24,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:40:24,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:40:24" (1/1) ... [2023-11-29 03:40:24,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:40:24" (1/1) ... [2023-11-29 03:40:24,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:40:24" (1/1) ... [2023-11-29 03:40:24,184 INFO L175 MemorySlicer]: Split 22 memory accesses to 2 slices as follows [2, 20]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2023-11-29 03:40:24,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:40:24" (1/1) ... [2023-11-29 03:40:24,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:40:24" (1/1) ... [2023-11-29 03:40:24,196 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:40:24" (1/1) ... [2023-11-29 03:40:24,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:40:24" (1/1) ... [2023-11-29 03:40:24,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:40:24" (1/1) ... [2023-11-29 03:40:24,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:40:24" (1/1) ... [2023-11-29 03:40:24,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:40:24,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:40:24,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:40:24,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:40:24,212 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:40:24" (1/1) ... [2023-11-29 03:40:24,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:40:24,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:40:24,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:24,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 03:40:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 03:40:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:40:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:40:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:40:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:40:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:40:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:40:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:40:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 03:40:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 03:40:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 03:40:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 03:40:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:40:24,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:40:24,404 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:40:24,407 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:40:24,894 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:40:24,941 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:40:24,941 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-11-29 03:40:24,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:40:24 BoogieIcfgContainer [2023-11-29 03:40:24,942 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:40:24,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:40:24,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:40:24,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:40:24,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:40:23" (1/3) ... [2023-11-29 03:40:24,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a70a4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:40:24, skipping insertion in model container [2023-11-29 03:40:24,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:40:24" (2/3) ... [2023-11-29 03:40:24,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a70a4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:40:24, skipping insertion in model container [2023-11-29 03:40:24,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:40:24" (3/3) ... [2023-11-29 03:40:24,951 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-1.i [2023-11-29 03:40:24,969 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:40:24,969 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2023-11-29 03:40:25,014 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:40:25,020 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;@26ab25a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:40:25,021 INFO L358 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2023-11-29 03:40:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 43 states have (on average 2.441860465116279) internal successors, (105), 88 states have internal predecessors, (105), 0 states have call successors, (0), 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:40:25,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 03:40:25,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:40:25,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 03:40:25,031 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:40:25,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:40:25,037 INFO L85 PathProgramCache]: Analyzing trace with hash 7165, now seen corresponding path program 1 times [2023-11-29 03:40:25,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:40:25,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552619841] [2023-11-29 03:40:25,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:40:25,050 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:40:25,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:40:25,052 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:25,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:40:25,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:40:25,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:40:25,204 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:40:25,216 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:40:25,216 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:40:25,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:40:25,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552619841] [2023-11-29 03:40:25,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552619841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:40:25,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:40:25,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:40:25,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221109197] [2023-11-29 03:40:25,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:40:25,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:40:25,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:40:25,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:40:25,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:40:25,249 INFO L87 Difference]: Start difference. First operand has 89 states, 43 states have (on average 2.441860465116279) internal successors, (105), 88 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:40:25,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:40:25,458 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2023-11-29 03:40:25,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:40:25,460 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:40:25,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:40:25,467 INFO L225 Difference]: With dead ends: 89 [2023-11-29 03:40:25,467 INFO L226 Difference]: Without dead ends: 88 [2023-11-29 03:40:25,469 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:40:25,472 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 75 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:40:25,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 49 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:40:25,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-29 03:40:25,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2023-11-29 03:40:25,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 41 states have (on average 2.1951219512195124) internal successors, (90), 83 states have internal predecessors, (90), 0 states have call successors, (0), 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:40:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2023-11-29 03:40:25,502 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 2 [2023-11-29 03:40:25,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:40:25,503 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2023-11-29 03:40:25,503 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:40:25,503 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2023-11-29 03:40:25,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 03:40:25,504 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:40:25,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 03:40:25,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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)] Ended with exit code 0 [2023-11-29 03:40:25,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:25,706 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:40:25,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:40:25,707 INFO L85 PathProgramCache]: Analyzing trace with hash 7166, now seen corresponding path program 1 times [2023-11-29 03:40:25,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:40:25,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163276548] [2023-11-29 03:40:25,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:40:25,707 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:40:25,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:40:25,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:25,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:40:25,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:40:25,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:40:25,763 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:40:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:40:25,774 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:40:25,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:40:25,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163276548] [2023-11-29 03:40:25,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163276548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:40:25,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:40:25,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:40:25,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422184235] [2023-11-29 03:40:25,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:40:25,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:40:25,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:40:25,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:40:25,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:40:25,778 INFO L87 Difference]: Start difference. First operand 84 states and 90 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:40:26,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:40:26,124 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2023-11-29 03:40:26,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:40:26,124 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:40:26,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:40:26,126 INFO L225 Difference]: With dead ends: 110 [2023-11-29 03:40:26,126 INFO L226 Difference]: Without dead ends: 110 [2023-11-29 03:40:26,127 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:40:26,128 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 73 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:40:26,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 90 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:40:26,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-29 03:40:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 82. [2023-11-29 03:40:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 41 states have (on average 2.1463414634146343) internal successors, (88), 81 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:40:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2023-11-29 03:40:26,138 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 2 [2023-11-29 03:40:26,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:40:26,139 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2023-11-29 03:40:26,139 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:40:26,139 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2023-11-29 03:40:26,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 03:40:26,140 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:40:26,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 03:40:26,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 03:40:26,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:26,341 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:40:26,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:40:26,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1967738720, now seen corresponding path program 1 times [2023-11-29 03:40:26,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:40:26,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110505347] [2023-11-29 03:40:26,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:40:26,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:40:26,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:40:26,344 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:26,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:40:26,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:40:26,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:40:26,416 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:40:26,464 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:40:26,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 03:40:26,480 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:40:26,481 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:40:26,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:40:26,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110505347] [2023-11-29 03:40:26,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110505347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:40:26,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:40:26,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:40:26,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351874444] [2023-11-29 03:40:26,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:40:26,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:40:26,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:40:26,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:40:26,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:40:26,484 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:40:26,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:40:26,848 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2023-11-29 03:40:26,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:40:26,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 03:40:26,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:40:26,850 INFO L225 Difference]: With dead ends: 84 [2023-11-29 03:40:26,850 INFO L226 Difference]: Without dead ends: 84 [2023-11-29 03:40:26,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:40:26,852 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 111 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:40:26,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 31 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:40:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-29 03:40:26,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2023-11-29 03:40:26,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 75 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:40:26,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2023-11-29 03:40:26,872 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 6 [2023-11-29 03:40:26,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:40:26,873 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2023-11-29 03:40:26,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:40:26,873 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2023-11-29 03:40:26,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 03:40:26,873 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:40:26,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 03:40:26,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:40:27,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:27,077 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:40:27,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:40:27,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1967738719, now seen corresponding path program 1 times [2023-11-29 03:40:27,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:40:27,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951516701] [2023-11-29 03:40:27,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:40:27,078 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:40:27,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:40:27,079 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:27,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:40:27,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:40:27,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:40:27,162 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:40:27,231 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 03:40:27,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-29 03:40:27,248 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:40:27,248 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:40:27,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:40:27,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951516701] [2023-11-29 03:40:27,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951516701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:40:27,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:40:27,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:40:27,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668215409] [2023-11-29 03:40:27,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:40:27,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:40:27,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:40:27,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:40:27,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:40:27,251 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:40:27,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:40:27,676 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2023-11-29 03:40:27,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:40:27,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 03:40:27,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:40:27,677 INFO L225 Difference]: With dead ends: 99 [2023-11-29 03:40:27,677 INFO L226 Difference]: Without dead ends: 99 [2023-11-29 03:40:27,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:40:27,678 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 106 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:40:27,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 48 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:40:27,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-29 03:40:27,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2023-11-29 03:40:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 87 states have internal predecessors, (100), 0 states have call successors, (0), 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:40:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2023-11-29 03:40:27,684 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 6 [2023-11-29 03:40:27,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:40:27,684 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2023-11-29 03:40:27,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:40:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2023-11-29 03:40:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 03:40:27,685 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:40:27,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:40:27,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:27,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:27,885 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:40:27,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:40:27,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1211118797, now seen corresponding path program 1 times [2023-11-29 03:40:27,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:40:27,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696101409] [2023-11-29 03:40:27,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:40:27,891 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:40:27,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:40:27,892 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:27,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:40:27,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:40:27,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:40:27,995 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:40:28,011 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:40:28,031 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:40:28,041 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:40:28,041 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:40:28,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:40:28,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696101409] [2023-11-29 03:40:28,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696101409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:40:28,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:40:28,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:40:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576014615] [2023-11-29 03:40:28,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:40:28,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:40:28,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:40:28,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:40:28,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:40:28,044 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:40:28,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:40:28,422 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2023-11-29 03:40:28,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:40:28,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 03:40:28,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:40:28,423 INFO L225 Difference]: With dead ends: 87 [2023-11-29 03:40:28,424 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 03:40:28,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:40:28,425 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:40:28,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 95 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:40:28,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 03:40:28,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-29 03:40:28,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.596774193548387) internal successors, (99), 86 states have internal predecessors, (99), 0 states have call successors, (0), 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:40:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2023-11-29 03:40:28,432 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 8 [2023-11-29 03:40:28,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:40:28,433 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2023-11-29 03:40:28,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:40:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2023-11-29 03:40:28,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 03:40:28,434 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:40:28,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:40:28,436 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:28,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:28,636 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:40:28,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:40:28,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1211118796, now seen corresponding path program 1 times [2023-11-29 03:40:28,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:40:28,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116761972] [2023-11-29 03:40:28,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:40:28,637 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:40:28,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:40:28,638 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:28,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:40:28,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 03:40:28,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:40:28,702 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:40:28,723 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:40:28,728 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:40:28,758 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:40:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:40:28,774 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:40:28,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:40:28,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116761972] [2023-11-29 03:40:28,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116761972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:40:28,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:40:28,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:40:28,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412915235] [2023-11-29 03:40:28,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:40:28,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:40:28,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:40:28,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:40:28,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:40:28,776 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:40:29,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:40:29,195 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2023-11-29 03:40:29,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:40:29,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 03:40:29,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:40:29,196 INFO L225 Difference]: With dead ends: 86 [2023-11-29 03:40:29,196 INFO L226 Difference]: Without dead ends: 86 [2023-11-29 03:40:29,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:40:29,197 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 8 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:40:29,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 140 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:40:29,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-29 03:40:29,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2023-11-29 03:40:29,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 78 states have internal predecessors, (90), 0 states have call successors, (0), 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:40:29,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2023-11-29 03:40:29,202 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 8 [2023-11-29 03:40:29,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:40:29,203 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2023-11-29 03:40:29,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:40:29,203 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2023-11-29 03:40:29,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 03:40:29,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:40:29,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:40:29,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:29,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:29,404 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:40:29,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:40:29,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1479297325, now seen corresponding path program 1 times [2023-11-29 03:40:29,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:40:29,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498425811] [2023-11-29 03:40:29,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:40:29,405 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:40:29,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:40:29,406 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:29,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:40:29,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 03:40:29,478 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:40:29,493 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:40:29,499 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:40:29,530 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:40:29,539 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:40:29,626 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:40:29,626 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:40:29,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:40:29,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498425811] [2023-11-29 03:40:29,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [498425811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:40:29,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:40:29,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:40:29,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360897216] [2023-11-29 03:40:29,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:40:29,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:40:29,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:40:29,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:40:29,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:40:29,628 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:40:30,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:40:30,113 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2023-11-29 03:40:30,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:40:30,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 03:40:30,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:40:30,114 INFO L225 Difference]: With dead ends: 118 [2023-11-29 03:40:30,114 INFO L226 Difference]: Without dead ends: 118 [2023-11-29 03:40:30,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:40:30,115 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 80 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:40:30,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 235 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:40:30,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-29 03:40:30,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 85. [2023-11-29 03:40:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.53125) internal successors, (98), 84 states have internal predecessors, (98), 0 states have call successors, (0), 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:40:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2023-11-29 03:40:30,121 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 12 [2023-11-29 03:40:30,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:40:30,121 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2023-11-29 03:40:30,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:40:30,121 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2023-11-29 03:40:30,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 03:40:30,122 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:40:30,122 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:40:30,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 03:40:30,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:30,323 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:40:30,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:40:30,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1950625586, now seen corresponding path program 1 times [2023-11-29 03:40:30,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:40:30,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319250061] [2023-11-29 03:40:30,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:40:30,324 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:40:30,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:40:30,325 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:30,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:40:30,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 03:40:30,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:40:30,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:40:30,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 03:40:30,489 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:40:30,489 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:40:30,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:40:30,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319250061] [2023-11-29 03:40:30,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319250061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:40:30,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:40:30,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:40:30,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809883635] [2023-11-29 03:40:30,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:40:30,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:40:30,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:40:30,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:40:30,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:40:30,491 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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:40:30,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:40:30,941 INFO L93 Difference]: Finished difference Result 114 states and 128 transitions. [2023-11-29 03:40:30,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:40:30,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-11-29 03:40:30,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:40:30,942 INFO L225 Difference]: With dead ends: 114 [2023-11-29 03:40:30,942 INFO L226 Difference]: Without dead ends: 114 [2023-11-29 03:40:30,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:40:30,943 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 36 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:40:30,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 166 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:40:30,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-29 03:40:30,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2023-11-29 03:40:30,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.507462686567164) internal successors, (101), 87 states have internal predecessors, (101), 0 states have call successors, (0), 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:40:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2023-11-29 03:40:30,949 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 14 [2023-11-29 03:40:30,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:40:30,949 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2023-11-29 03:40:30,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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:40:30,949 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2023-11-29 03:40:30,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 03:40:30,950 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:40:30,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:40:30,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 03:40:31,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:31,151 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:40:31,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:40:31,151 INFO L85 PathProgramCache]: Analyzing trace with hash -339904869, now seen corresponding path program 1 times [2023-11-29 03:40:31,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:40:31,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060694747] [2023-11-29 03:40:31,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:40:31,152 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:40:31,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:40:31,153 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:31,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:40:31,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 03:40:31,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:40:31,239 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:40:31,270 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:40:31,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 03:40:31,303 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:40:31,367 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:40:31,397 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:40:31,397 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:40:31,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:40:31,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060694747] [2023-11-29 03:40:31,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060694747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:40:31,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:40:31,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:40:31,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473083496] [2023-11-29 03:40:31,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:40:31,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:40:31,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:40:31,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:40:31,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:40:31,399 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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:40:31,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:40:31,853 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2023-11-29 03:40:31,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:40:31,853 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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:40:31,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:40:31,854 INFO L225 Difference]: With dead ends: 118 [2023-11-29 03:40:31,854 INFO L226 Difference]: Without dead ends: 118 [2023-11-29 03:40:31,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:40:31,855 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 209 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:40:31,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 64 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:40:31,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-29 03:40:31,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2023-11-29 03:40:31,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 90 states have internal predecessors, (106), 0 states have call successors, (0), 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:40:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2023-11-29 03:40:31,860 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 15 [2023-11-29 03:40:31,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:40:31,861 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2023-11-29 03:40:31,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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:40:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2023-11-29 03:40:31,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 03:40:31,862 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:40:31,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:40:31,865 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:32,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:32,065 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:40:32,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:40:32,065 INFO L85 PathProgramCache]: Analyzing trace with hash -339904868, now seen corresponding path program 1 times [2023-11-29 03:40:32,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:40:32,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177319260] [2023-11-29 03:40:32,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:40:32,065 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:40:32,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:40:32,066 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:32,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:40:32,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 03:40:32,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:40:32,184 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:40:32,237 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 03:40:32,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-29 03:40:32,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:40:32,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:40:32,365 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:40:32,372 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 7 treesize of output 3 [2023-11-29 03:40:32,408 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:40:32,409 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:40:32,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:40:32,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177319260] [2023-11-29 03:40:32,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177319260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:40:32,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:40:32,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:40:32,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444883857] [2023-11-29 03:40:32,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:40:32,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:40:32,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:40:32,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:40:32,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:40:32,410 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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:40:33,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:40:33,209 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2023-11-29 03:40:33,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:40:33,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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:40:33,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:40:33,211 INFO L225 Difference]: With dead ends: 140 [2023-11-29 03:40:33,211 INFO L226 Difference]: Without dead ends: 140 [2023-11-29 03:40:33,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:40:33,212 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 214 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:40:33,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 109 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 03:40:33,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-29 03:40:33,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 106. [2023-11-29 03:40:33,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.5294117647058822) internal successors, (130), 105 states have internal predecessors, (130), 0 states have call successors, (0), 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:40:33,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2023-11-29 03:40:33,216 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 130 transitions. Word has length 15 [2023-11-29 03:40:33,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:40:33,216 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 130 transitions. [2023-11-29 03:40:33,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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:40:33,216 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 130 transitions. [2023-11-29 03:40:33,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 03:40:33,217 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:40:33,217 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:40:33,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:40:33,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:33,417 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:40:33,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:40:33,418 INFO L85 PathProgramCache]: Analyzing trace with hash 329551461, now seen corresponding path program 1 times [2023-11-29 03:40:33,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:40:33,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283183863] [2023-11-29 03:40:33,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:40:33,418 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:40:33,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:40:33,419 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:33,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:40:33,513 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 03:40:33,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:40:33,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:40:33,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:40:33,620 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:40:33,621 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:40:33,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:40:33,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283183863] [2023-11-29 03:40:33,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283183863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:40:33,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:40:33,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:40:33,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274813459] [2023-11-29 03:40:33,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:40:33,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:40:33,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:40:33,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:40:33,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:40:33,622 INFO L87 Difference]: Start difference. First operand 106 states and 130 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:40:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:40:34,080 INFO L93 Difference]: Finished difference Result 140 states and 164 transitions. [2023-11-29 03:40:34,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:40:34,080 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:40:34,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:40:34,081 INFO L225 Difference]: With dead ends: 140 [2023-11-29 03:40:34,081 INFO L226 Difference]: Without dead ends: 140 [2023-11-29 03:40:34,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:40:34,082 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 49 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:40:34,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 161 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:40:34,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-29 03:40:34,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 109. [2023-11-29 03:40:34,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.5113636363636365) internal successors, (133), 108 states have internal predecessors, (133), 0 states have call successors, (0), 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:40:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2023-11-29 03:40:34,086 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 18 [2023-11-29 03:40:34,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:40:34,086 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2023-11-29 03:40:34,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:40:34,086 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2023-11-29 03:40:34,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 03:40:34,087 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:40:34,087 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:40:34,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:34,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:34,288 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:40:34,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:40:34,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1426446504, now seen corresponding path program 1 times [2023-11-29 03:40:34,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:40:34,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343045324] [2023-11-29 03:40:34,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:40:34,289 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:40:34,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:40:34,290 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:34,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:40:34,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 03:40:34,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:40:34,385 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:40:34,409 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:40:34,418 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:40:34,419 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:40:34,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:40:34,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343045324] [2023-11-29 03:40:34,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343045324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:40:34,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:40:34,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:40:34,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873647025] [2023-11-29 03:40:34,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:40:34,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:40:34,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:40:34,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:40:34,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:40:34,421 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:40:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:40:34,921 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2023-11-29 03:40:34,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:40:34,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:40:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:40:34,923 INFO L225 Difference]: With dead ends: 131 [2023-11-29 03:40:34,923 INFO L226 Difference]: Without dead ends: 131 [2023-11-29 03:40:34,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:40:34,923 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 152 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:40:34,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 135 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:40:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-29 03:40:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 109. [2023-11-29 03:40:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 108 states have internal predecessors, (129), 0 states have call successors, (0), 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:40:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2023-11-29 03:40:34,928 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 18 [2023-11-29 03:40:34,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:40:34,928 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2023-11-29 03:40:34,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:40:34,928 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2023-11-29 03:40:34,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 03:40:34,929 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:40:34,929 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:40:34,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:35,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:35,132 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:40:35,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:40:35,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2113307920, now seen corresponding path program 1 times [2023-11-29 03:40:35,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:40:35,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503996760] [2023-11-29 03:40:35,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:40:35,133 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:40:35,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:40:35,134 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:35,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:40:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:40:35,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 03:40:35,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:40:35,276 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:40:35,358 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:40:35,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:40:35,422 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:40:35,506 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:40:35,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2023-11-29 03:40:35,546 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:40:35,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:40:35,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 27 treesize of output 15 [2023-11-29 03:40:35,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:40:35,706 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:40:37,087 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_316 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_316) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2023-11-29 03:40:37,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:40:37,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-11-29 03:40:37,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:40:37,120 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 38 treesize of output 41 [2023-11-29 03:40:37,127 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:41:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:02,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:41:02,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503996760] [2023-11-29 03:41:02,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503996760] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:41:02,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:41:02,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2023-11-29 03:41:02,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364039985] [2023-11-29 03:41:02,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:41:02,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 03:41:02,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:41:02,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 03:41:02,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=202, Unknown=3, NotChecked=30, Total=306 [2023-11-29 03:41:02,917 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 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:41:09,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:09,780 INFO L93 Difference]: Finished difference Result 235 states and 266 transitions. [2023-11-29 03:41:09,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 03:41:09,781 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 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:41:09,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:09,783 INFO L225 Difference]: With dead ends: 235 [2023-11-29 03:41:09,783 INFO L226 Difference]: Without dead ends: 235 [2023-11-29 03:41:09,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=221, Invalid=647, Unknown=6, NotChecked=56, Total=930 [2023-11-29 03:41:09,784 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 579 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 120 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 251 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:09,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 275 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 725 Invalid, 14 Unknown, 251 Unchecked, 2.3s Time] [2023-11-29 03:41:09,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-11-29 03:41:09,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 153. [2023-11-29 03:41:09,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 152 states have internal predecessors, (202), 0 states have call successors, (0), 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:41:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 202 transitions. [2023-11-29 03:41:09,790 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 202 transitions. Word has length 18 [2023-11-29 03:41:09,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:09,790 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 202 transitions. [2023-11-29 03:41:09,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 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:41:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 202 transitions. [2023-11-29 03:41:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 03:41:09,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:09,792 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:41:09,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:09,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:09,992 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:41:09,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2113307919, now seen corresponding path program 1 times [2023-11-29 03:41:09,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:41:09,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197723879] [2023-11-29 03:41:09,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:09,993 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:41:09,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:41:09,994 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:09,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:10,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 03:41:10,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:41:10,096 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:41:10,158 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:41:10,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 13 treesize of output 13 [2023-11-29 03:41:10,167 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:41:10,218 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:41:10,231 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:41:10,353 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:41:10,354 INFO L378 Elim1Store]: Elim1 eliminated variable 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:41:10,361 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:41:10,389 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:41:10,390 INFO L378 Elim1Store]: Elim1 eliminated variable 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:41:10,447 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:41:10,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:41:10,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:41:10,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:41:10,625 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:41:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:10,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:41:11,057 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_359) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_359) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2023-11-29 03:41:11,119 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_359) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_358) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_359) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2023-11-29 03:41:11,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:41:11,142 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 28 [2023-11-29 03:41:11,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:41:11,176 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 40 treesize of output 39 [2023-11-29 03:41:11,215 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 5 [2023-11-29 03:41:11,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:41:11,234 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 37 treesize of output 38 [2023-11-29 03:41:11,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:41:11,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-11-29 03:41:11,260 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:41:11,265 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-11-29 03:41:11,273 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:41:11,279 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 03:41:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:11,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:41:11,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197723879] [2023-11-29 03:41:11,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197723879] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:41:11,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:41:11,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-11-29 03:41:11,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959241549] [2023-11-29 03:41:11,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:41:11,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 03:41:11,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:41:11,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 03:41:11,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=172, Unknown=2, NotChecked=54, Total=272 [2023-11-29 03:41:11,480 INFO L87 Difference]: Start difference. First operand 153 states and 202 transitions. Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 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:41:14,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:14,666 INFO L93 Difference]: Finished difference Result 193 states and 227 transitions. [2023-11-29 03:41:14,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 03:41:14,666 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 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:41:14,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:14,667 INFO L225 Difference]: With dead ends: 193 [2023-11-29 03:41:14,667 INFO L226 Difference]: Without dead ends: 193 [2023-11-29 03:41:14,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=150, Invalid=558, Unknown=2, NotChecked=102, Total=812 [2023-11-29 03:41:14,668 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 278 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:14,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 335 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 774 Invalid, 0 Unknown, 383 Unchecked, 2.5s Time] [2023-11-29 03:41:14,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-11-29 03:41:14,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 153. [2023-11-29 03:41:14,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 136 states have (on average 1.4411764705882353) internal successors, (196), 152 states have internal predecessors, (196), 0 states have call successors, (0), 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:41:14,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 196 transitions. [2023-11-29 03:41:14,672 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 196 transitions. Word has length 18 [2023-11-29 03:41:14,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:14,672 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 196 transitions. [2023-11-29 03:41:14,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 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:41:14,672 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 196 transitions. [2023-11-29 03:41:14,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:41:14,673 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:14,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:41:14,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 03:41:14,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:14,874 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:41:14,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:14,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1626106852, now seen corresponding path program 1 times [2023-11-29 03:41:14,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:41:14,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200767640] [2023-11-29 03:41:14,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:14,874 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:41:14,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:41:14,875 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:14,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:14,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 03:41:14,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:41:15,064 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 7 treesize of output 3 [2023-11-29 03:41:15,069 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 7 treesize of output 3 [2023-11-29 03:41:15,138 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:41:15,145 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:41:15,223 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:41:15,223 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:41:15,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:41:15,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200767640] [2023-11-29 03:41:15,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200767640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:41:15,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:41:15,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 03:41:15,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169446942] [2023-11-29 03:41:15,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:41:15,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:41:15,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:41:15,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:41:15,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:41:15,225 INFO L87 Difference]: Start difference. First operand 153 states and 196 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:41:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:16,055 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2023-11-29 03:41:16,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:41:16,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 03:41:16,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:16,057 INFO L225 Difference]: With dead ends: 175 [2023-11-29 03:41:16,057 INFO L226 Difference]: Without dead ends: 175 [2023-11-29 03:41:16,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:41:16,057 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 57 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:16,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 151 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:41:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-29 03:41:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 169. [2023-11-29 03:41:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 152 states have (on average 1.4013157894736843) internal successors, (213), 168 states have internal predecessors, (213), 0 states have call successors, (0), 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:41:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 213 transitions. [2023-11-29 03:41:16,062 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 213 transitions. Word has length 19 [2023-11-29 03:41:16,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:16,062 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 213 transitions. [2023-11-29 03:41:16,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:41:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 213 transitions. [2023-11-29 03:41:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:41:16,062 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:16,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:41:16,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:16,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:16,263 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:41:16,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:16,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1288229249, now seen corresponding path program 1 times [2023-11-29 03:41:16,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:41:16,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038161107] [2023-11-29 03:41:16,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:16,264 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:41:16,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:41:16,265 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:16,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:16,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 03:41:16,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:41:16,355 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:41:16,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:41:16,417 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:41:16,417 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:41:16,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-29 03:41:16,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 03:41:16,478 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:41:16,484 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:41:16,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-11-29 03:41:16,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-29 03:41:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:16,617 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:41:16,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:41:16,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038161107] [2023-11-29 03:41:16,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038161107] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:41:16,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:41:16,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:41:16,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693948800] [2023-11-29 03:41:16,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:41:16,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:41:16,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:41:16,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:41:16,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:41:16,619 INFO L87 Difference]: Start difference. First operand 169 states and 213 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:41:18,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 03:41:18,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:18,813 INFO L93 Difference]: Finished difference Result 203 states and 248 transitions. [2023-11-29 03:41:18,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:41:18,814 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 03:41:18,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:18,815 INFO L225 Difference]: With dead ends: 203 [2023-11-29 03:41:18,815 INFO L226 Difference]: Without dead ends: 203 [2023-11-29 03:41:18,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2023-11-29 03:41:18,816 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 115 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:18,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 177 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 03:41:18,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-11-29 03:41:18,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 178. [2023-11-29 03:41:18,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 177 states have internal predecessors, (222), 0 states have call successors, (0), 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:41:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 222 transitions. [2023-11-29 03:41:18,822 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 222 transitions. Word has length 19 [2023-11-29 03:41:18,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:18,822 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 222 transitions. [2023-11-29 03:41:18,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:41:18,823 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 222 transitions. [2023-11-29 03:41:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:41:18,823 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:18,823 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:41:18,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:19,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:19,024 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:41:19,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:19,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1289095528, now seen corresponding path program 1 times [2023-11-29 03:41:19,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:41:19,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031910491] [2023-11-29 03:41:19,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:19,025 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:41:19,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:41:19,026 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:19,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:19,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 03:41:19,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:41:19,158 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:41:19,164 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:41:19,194 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:41:19,201 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:41:19,283 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:41:19,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 03:41:19,318 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:41:19,319 INFO L378 Elim1Store]: Elim1 eliminated variable 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:41:19,393 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-11-29 03:41:19,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2023-11-29 03:41:19,431 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-11-29 03:41:19,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2023-11-29 03:41:19,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:41:19,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 94 [2023-11-29 03:41:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:20,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:41:20,775 INFO L349 Elim1Store]: treesize reduction 4, result has 78.9 percent of original size [2023-11-29 03:41:20,776 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 28 treesize of output 23 [2023-11-29 03:41:21,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:41:21,078 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 1 case distinctions, treesize of input 13 treesize of output 17 [2023-11-29 03:41:21,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:41:21,094 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 1 case distinctions, treesize of input 13 treesize of output 17 [2023-11-29 03:41:21,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:41:21,113 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 1 case distinctions, treesize of input 13 treesize of output 17 [2023-11-29 03:41:21,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:41:21,130 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 13 treesize of output 17 [2023-11-29 03:41:21,148 WARN L854 $PredicateComparison]: unable to prove that (and (or (and (forall ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (not (= (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.offset|)) (forall ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32)) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_8 |c_ULTIMATE.start_main_~x~0#1.offset|))))) (forall ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32)) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)))) is different from false [2023-11-29 03:41:21,224 WARN L854 $PredicateComparison]: unable to prove that (and (or (and (forall ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_6 (_ bv0 32)))))) (forall ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32)) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_5 (_ bv0 32)))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32))) (forall ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32)) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_7 (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (forall ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32)) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_8 (_ bv0 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)))) is different from false [2023-11-29 03:41:21,769 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:41:21,772 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-29 03:41:21,772 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2023-11-29 03:41:21,778 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:41:21,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:41:21,789 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-11-29 03:41:21,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-11-29 03:41:21,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-29 03:41:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:21,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:41:21,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031910491] [2023-11-29 03:41:21,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031910491] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:41:21,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:41:21,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2023-11-29 03:41:21,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183035032] [2023-11-29 03:41:21,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:41:21,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 03:41:21,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:41:21,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 03:41:21,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=423, Unknown=14, NotChecked=86, Total=600 [2023-11-29 03:41:21,801 INFO L87 Difference]: Start difference. First operand 178 states and 222 transitions. Second operand has 25 states, 25 states have (on average 1.4) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:41:24,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:24,962 INFO L93 Difference]: Finished difference Result 198 states and 238 transitions. [2023-11-29 03:41:24,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 03:41:24,963 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.4) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 03:41:24,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:24,964 INFO L225 Difference]: With dead ends: 198 [2023-11-29 03:41:24,964 INFO L226 Difference]: Without dead ends: 198 [2023-11-29 03:41:24,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=203, Invalid=1046, Unknown=19, NotChecked=138, Total=1406 [2023-11-29 03:41:24,965 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 190 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:24,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 367 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 640 Invalid, 0 Unknown, 242 Unchecked, 1.8s Time] [2023-11-29 03:41:24,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-11-29 03:41:24,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 180. [2023-11-29 03:41:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 163 states have (on average 1.3742331288343559) internal successors, (224), 179 states have internal predecessors, (224), 0 states have call successors, (0), 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:41:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 224 transitions. [2023-11-29 03:41:24,969 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 224 transitions. Word has length 19 [2023-11-29 03:41:24,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:24,969 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 224 transitions. [2023-11-29 03:41:24,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.4) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:41:24,969 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2023-11-29 03:41:24,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 03:41:24,970 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:24,970 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:41:24,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:41:25,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:25,171 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:41:25,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:25,171 INFO L85 PathProgramCache]: Analyzing trace with hash 436286981, now seen corresponding path program 2 times [2023-11-29 03:41:25,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:41:25,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653869798] [2023-11-29 03:41:25,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:41:25,172 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:41:25,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:41:25,173 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:25,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:25,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:41:25,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:41:25,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 03:41:25,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:41:25,308 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:41:25,366 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:41:25,366 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:41:25,387 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:41:25,462 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:41:25,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 24 treesize of output 17 [2023-11-29 03:41:25,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:41:25,474 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:41:25,502 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-11-29 03:41:25,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2023-11-29 03:41:25,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-11-29 03:41:25,760 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:25,760 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:41:26,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:41:26,067 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 33 treesize of output 37 [2023-11-29 03:41:26,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:41:26,074 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 30 treesize of output 31 [2023-11-29 03:41:26,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:41:26,095 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 33 treesize of output 34 [2023-11-29 03:41:26,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:41:26,101 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:41:26,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:41:26,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 176 treesize of output 245 [2023-11-29 03:41:26,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:41:26,471 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 180 treesize of output 218 [2023-11-29 03:41:30,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2023-11-29 03:41:30,704 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:41:30,706 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2023-11-29 03:41:30,710 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:41:30,916 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:30,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:41:30,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653869798] [2023-11-29 03:41:30,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653869798] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:41:30,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:41:30,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2023-11-29 03:41:30,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664547711] [2023-11-29 03:41:30,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:41:30,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 03:41:30,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:41:30,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 03:41:30,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=231, Unknown=1, NotChecked=0, Total=272 [2023-11-29 03:41:30,918 INFO L87 Difference]: Start difference. First operand 180 states and 224 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 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:41:35,712 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 [0] [2023-11-29 03:41:40,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:41:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:42,071 INFO L93 Difference]: Finished difference Result 205 states and 246 transitions. [2023-11-29 03:41:42,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:41:42,071 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 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 22 [2023-11-29 03:41:42,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:42,072 INFO L225 Difference]: With dead ends: 205 [2023-11-29 03:41:42,072 INFO L226 Difference]: Without dead ends: 205 [2023-11-29 03:41:42,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=107, Invalid=492, Unknown=1, NotChecked=0, Total=600 [2023-11-29 03:41:42,073 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 162 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 34 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:42,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 367 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 837 Invalid, 2 Unknown, 0 Unchecked, 10.7s Time] [2023-11-29 03:41:42,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-11-29 03:41:42,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 179. [2023-11-29 03:41:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 162 states have (on average 1.3641975308641976) internal successors, (221), 178 states have internal predecessors, (221), 0 states have call successors, (0), 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:41:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 221 transitions. [2023-11-29 03:41:42,077 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 221 transitions. Word has length 22 [2023-11-29 03:41:42,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:42,077 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 221 transitions. [2023-11-29 03:41:42,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 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:41:42,077 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 221 transitions. [2023-11-29 03:41:42,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 03:41:42,078 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:42,078 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] [2023-11-29 03:41:42,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 03:41:42,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:42,278 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:41:42,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:42,278 INFO L85 PathProgramCache]: Analyzing trace with hash -93883673, now seen corresponding path program 1 times [2023-11-29 03:41:42,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:41:42,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510773819] [2023-11-29 03:41:42,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:41:42,279 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:41:42,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:41:42,280 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:42,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 03:41:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:41:42,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:41:42,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:41:42,524 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:41:42,524 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:41:42,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:41:42,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510773819] [2023-11-29 03:41:42,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510773819] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:41:42,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:41:42,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:41:42,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963025651] [2023-11-29 03:41:42,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:41:42,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:41:42,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:41:42,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:41:42,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:41:42,526 INFO L87 Difference]: Start difference. First operand 179 states and 221 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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:41:42,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:41:42,828 INFO L93 Difference]: Finished difference Result 186 states and 225 transitions. [2023-11-29 03:41:42,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:41:42,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2023-11-29 03:41:42,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:41:42,831 INFO L225 Difference]: With dead ends: 186 [2023-11-29 03:41:42,831 INFO L226 Difference]: Without dead ends: 186 [2023-11-29 03:41:42,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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:41:42,832 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 67 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:41:42,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 64 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:41:42,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-11-29 03:41:42,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 180. [2023-11-29 03:41:42,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 163 states have (on average 1.343558282208589) internal successors, (219), 179 states have internal predecessors, (219), 0 states have call successors, (0), 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:41:42,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 219 transitions. [2023-11-29 03:41:42,837 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 219 transitions. Word has length 23 [2023-11-29 03:41:42,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:41:42,837 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 219 transitions. [2023-11-29 03:41:42,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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:41:42,837 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 219 transitions. [2023-11-29 03:41:42,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 03:41:42,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:41:42,838 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:41:42,840 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 03:41:43,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:43,039 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:41:43,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:41:43,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1859980915, now seen corresponding path program 3 times [2023-11-29 03:41:43,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:41:43,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160426668] [2023-11-29 03:41:43,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 03:41:43,039 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:41:43,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:41:43,040 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:41:43,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-29 03:41:43,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 03:41:43,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:41:43,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 03:41:43,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:41:43,223 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 03:41:43,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2023-11-29 03:41:43,345 INFO L349 Elim1Store]: treesize reduction 16, result has 48.4 percent of original size [2023-11-29 03:41:43,345 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 22 treesize of output 30 [2023-11-29 03:41:43,384 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:41:43,453 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:41:43,454 INFO L378 Elim1Store]: Elim1 eliminated variable 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:41:43,481 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:41:43,482 INFO L378 Elim1Store]: Elim1 eliminated variable 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:41:43,519 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:41:43,519 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:41:43,571 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-11-29 03:41:43,571 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:41:43,726 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:41:43,727 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:41:43,746 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:41:43,853 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 03:41:43,854 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:41:43,986 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:41:44,017 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:41:44,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:41:44,121 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_607 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_607) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2023-11-29 03:41:44,143 INFO L349 Elim1Store]: treesize reduction 7, result has 66.7 percent of original size [2023-11-29 03:41:44,143 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 27 treesize of output 26 [2023-11-29 03:41:44,151 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_607 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_607) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) is different from false [2023-11-29 03:41:44,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:41:44,651 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 16 treesize of output 20 [2023-11-29 03:41:52,950 INFO L349 Elim1Store]: treesize reduction 7, result has 41.7 percent of original size [2023-11-29 03:41:52,950 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 17 treesize of output 16 [2023-11-29 03:41:53,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:41:53,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-11-29 03:41:53,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:41:53,225 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 68 treesize of output 71 [2023-11-29 03:41:53,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:41:53,245 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 57 [2023-11-29 03:41:53,253 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 46 treesize of output 42 [2023-11-29 03:41:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-29 03:41:54,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:41:54,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160426668] [2023-11-29 03:41:54,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160426668] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:41:54,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:41:54,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2023-11-29 03:41:54,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149642035] [2023-11-29 03:41:54,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:41:54,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 03:41:54,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:41:54,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 03:41:54,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=382, Unknown=21, NotChecked=82, Total=552 [2023-11-29 03:41:54,865 INFO L87 Difference]: Start difference. First operand 180 states and 219 transitions. Second operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 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:42:06,284 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:42:08,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:42:12,314 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:42:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:42:16,819 INFO L93 Difference]: Finished difference Result 285 states and 331 transitions. [2023-11-29 03:42:16,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 03:42:16,819 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 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 24 [2023-11-29 03:42:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:42:16,820 INFO L225 Difference]: With dead ends: 285 [2023-11-29 03:42:16,820 INFO L226 Difference]: Without dead ends: 285 [2023-11-29 03:42:16,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=248, Invalid=1142, Unknown=24, NotChecked=146, Total=1560 [2023-11-29 03:42:16,822 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 497 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 143 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 456 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:42:16,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 498 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1259 Invalid, 2 Unknown, 456 Unchecked, 14.6s Time] [2023-11-29 03:42:16,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-11-29 03:42:16,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 223. [2023-11-29 03:42:16,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 206 states have (on average 1.3786407766990292) internal successors, (284), 222 states have internal predecessors, (284), 0 states have call successors, (0), 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:42:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 284 transitions. [2023-11-29 03:42:16,829 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 284 transitions. Word has length 24 [2023-11-29 03:42:16,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:42:16,829 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 284 transitions. [2023-11-29 03:42:16,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 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:42:16,829 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 284 transitions. [2023-11-29 03:42:16,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 03:42:16,830 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:42:16,830 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:42:16,834 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-11-29 03:42:17,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:42:17,030 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:42:17,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:42:17,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1859980916, now seen corresponding path program 2 times [2023-11-29 03:42:17,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:42:17,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833506319] [2023-11-29 03:42:17,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:42:17,031 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:42:17,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:42:17,032 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:42:17,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-29 03:42:17,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:42:17,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:42:17,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 03:42:17,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:42:17,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:42:17,289 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:42:17,289 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:42:17,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:42:17,344 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:42:17,468 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:42:17,468 INFO L378 Elim1Store]: Elim1 eliminated variable 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:42:17,505 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:42:17,505 INFO L378 Elim1Store]: Elim1 eliminated variable 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:42:17,577 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:42:17,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 03:42:17,617 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:42:17,617 INFO L378 Elim1Store]: Elim1 eliminated variable 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:42:17,779 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:42:17,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 03:42:17,816 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-11-29 03:42:17,816 INFO L378 Elim1Store]: Elim1 eliminated variable 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 15 [2023-11-29 03:42:18,068 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2023-11-29 03:42:18,068 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2023-11-29 03:42:18,155 INFO L349 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2023-11-29 03:42:18,155 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 54 treesize of output 55 [2023-11-29 03:42:18,179 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:42:18,241 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 44 treesize of output 32 [2023-11-29 03:42:18,669 INFO L349 Elim1Store]: treesize reduction 36, result has 61.7 percent of original size [2023-11-29 03:42:18,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 120 [2023-11-29 03:42:18,950 INFO L349 Elim1Store]: treesize reduction 36, result has 61.7 percent of original size [2023-11-29 03:42:18,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 116 [2023-11-29 03:42:33,782 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-11-29 03:42:33,782 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 84 [2023-11-29 03:42:33,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:33,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 46 [2023-11-29 03:42:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:42:34,090 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:42:35,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:35,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 81 treesize of output 81 [2023-11-29 03:42:35,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:35,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 75 treesize of output 69 [2023-11-29 03:42:35,937 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 6 treesize of output 4 [2023-11-29 03:42:38,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:38,846 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 188 treesize of output 236 [2023-11-29 03:42:40,070 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 6 treesize of output 4 [2023-11-29 03:42:43,176 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_17 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (bvule (bvadd (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) .cse2))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|))) (.cse4 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse4 (_ bv0 32)) (not (= (select v_prenex_13 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (= (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (_ bv0 32) (bvadd (_ bv4 32) .cse4)) (not (= (select v_prenex_12 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32)))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse5 (select (select (store .cse6 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse5 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_17 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (= (bvadd (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (_ bv0 32)) (= (select (select (store .cse6 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse5) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (= (select (select (store .cse7 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse7 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_prenex_14 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (let ((.cse8 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse8 (bvadd (_ bv4 32) .cse8))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse9 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_17 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (bvule (bvadd (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) .cse2)))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse10 (select (select (store .cse11 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse10 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse10 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_17 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (= (bvadd (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (_ bv0 32)) (= (select (select (store .cse11 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse12 (_ bv0 32)) (not (= (select v_prenex_13 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (= (select (select (store .cse13 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse13 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse12) .cse2) (not (= (select v_prenex_12 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32)))))) (forall ((v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (let ((.cse14 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse14 (_ bv0 32)) (bvule (bvadd (_ bv4 32) .cse14) .cse2) (not (= (select v_prenex_12 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32)))))) (forall ((v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (or (not (= (select v_prenex_14 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (let ((.cse15 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse15 (bvadd (_ bv4 32) .cse15))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse17 (select (select (store .cse18 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse16 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse16 (_ bv0 32)) (not (= (select v_prenex_13 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (= .cse17 (select (select (store .cse18 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse17 |c_ULTIMATE.start_main_~x~0#1.base|) (= (_ bv0 32) (bvadd (_ bv4 32) .cse16)) (not (= (select v_prenex_12 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse19 (select (select (store .cse20 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse19 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_17 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (= (select (select (store .cse20 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse19) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (bvule (bvadd (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) .cse2))))))) is different from false [2023-11-29 03:42:47,187 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_17 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (bvule (bvadd (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) .cse2))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|))) (.cse4 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse4 (_ bv0 32)) (not (= (select v_prenex_13 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (= (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (_ bv0 32) (bvadd (_ bv4 32) .cse4)) (not (= (select v_prenex_12 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32)))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse5 (select (select (store .cse6 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse5 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_17 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (= (bvadd (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (_ bv0 32)) (= (select (select (store .cse6 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse5) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (= (select (select (store .cse7 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse7 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_prenex_14 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (let ((.cse8 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse8 (bvadd (_ bv4 32) .cse8))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse9 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_17 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (bvule (bvadd (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) .cse2)))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse10 (select (select (store .cse11 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse10 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse10 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_17 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (= (bvadd (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (_ bv0 32)) (= (select (select (store .cse11 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse12 (_ bv0 32)) (not (= (select v_prenex_13 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (= (select (select (store .cse13 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse13 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse12) .cse2) (not (= (select v_prenex_12 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32)))))) (forall ((v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (let ((.cse14 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse14 (_ bv0 32)) (bvule (bvadd (_ bv4 32) .cse14) .cse2) (not (= (select v_prenex_12 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32)))))) (forall ((v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (or (not (= (select v_prenex_14 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (let ((.cse15 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse15 (bvadd (_ bv4 32) .cse15))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse17 (select (select (store .cse18 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse16 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse16 (_ bv0 32)) (not (= (select v_prenex_13 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (= .cse17 (select (select (store .cse18 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse17 |c_ULTIMATE.start_main_~x~0#1.base|) (= (_ bv0 32) (bvadd (_ bv4 32) .cse16)) (not (= (select v_prenex_12 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse19 (select (select (store .cse20 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse19 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_17 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (= (select (select (store .cse20 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse19) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (bvule (bvadd (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) .cse2))))))) is different from true [2023-11-29 03:42:48,435 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32))))) (and (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse0 (select (select (store .cse2 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse0 (_ bv0 32)) (= (bvadd (_ bv4 32) (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (= (select (select (store .cse2 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse0) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse4 (select (select (store .cse6 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse4 (_ bv0 32)) (bvule (bvadd (_ bv4 32) (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse5) (= (select (select (store .cse6 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse4) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse7 (select (select (store .cse8 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse7 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse7 (_ bv0 32)) (= (bvadd (_ bv4 32) (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (= (select (select (store .cse8 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (or (= (select (select (store .cse9 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse10 (_ bv0 32)) (= (bvadd (_ bv4 32) .cse10) (_ bv0 32)) (= (select (select (store .cse9 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32)))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse11 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse11 (_ bv0 32)) (bvule (bvadd (_ bv4 32) (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse5) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32)))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse12 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse13 (select (select (store .cse14 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse12 (_ bv0 32)) (= (bvadd (_ bv4 32) .cse12) (_ bv0 32)) (= .cse13 (select (select (store .cse14 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse13 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (= (select (select (store .cse15 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse15 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_prenex_14 (_ bv0 32)) (_ bv0 32))) (let ((.cse16 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse16 (bvadd (_ bv4 32) .cse16))))) (forall ((v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (let ((.cse17 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (bvule (bvadd (_ bv4 32) .cse17) .cse5) (= .cse17 (_ bv0 32)) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32)))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (bvule (bvadd (_ bv4 32) (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse5) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (bvule (bvadd (_ bv4 32) .cse18) .cse5) (= .cse18 (_ bv0 32)) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (= (select (select (store .cse19 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse19 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32)))))) (forall ((v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (or (not (= (select v_prenex_14 (_ bv0 32)) (_ bv0 32))) (let ((.cse20 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse20 (bvadd (_ bv4 32) .cse20))))))) is different from false [2023-11-29 03:42:52,447 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32))))) (and (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse0 (select (select (store .cse2 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse0 (_ bv0 32)) (= (bvadd (_ bv4 32) (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (= (select (select (store .cse2 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse0) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse4 (select (select (store .cse6 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse4 (_ bv0 32)) (bvule (bvadd (_ bv4 32) (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse5) (= (select (select (store .cse6 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse4) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse7 (select (select (store .cse8 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse7 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse7 (_ bv0 32)) (= (bvadd (_ bv4 32) (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (= (select (select (store .cse8 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (or (= (select (select (store .cse9 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse10 (_ bv0 32)) (= (bvadd (_ bv4 32) .cse10) (_ bv0 32)) (= (select (select (store .cse9 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32)))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse11 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse11 (_ bv0 32)) (bvule (bvadd (_ bv4 32) (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse5) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32)))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse12 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse13 (select (select (store .cse14 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse12 (_ bv0 32)) (= (bvadd (_ bv4 32) .cse12) (_ bv0 32)) (= .cse13 (select (select (store .cse14 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse13 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (= (select (select (store .cse15 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse15 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_prenex_14 (_ bv0 32)) (_ bv0 32))) (let ((.cse16 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse16 (bvadd (_ bv4 32) .cse16))))) (forall ((v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (let ((.cse17 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (bvule (bvadd (_ bv4 32) .cse17) .cse5) (= .cse17 (_ bv0 32)) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32)))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (bvule (bvadd (_ bv4 32) (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse5) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (bvule (bvadd (_ bv4 32) .cse18) .cse5) (= .cse18 (_ bv0 32)) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (= (select (select (store .cse19 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse19 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32)))))) (forall ((v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (or (not (= (select v_prenex_14 (_ bv0 32)) (_ bv0 32))) (let ((.cse20 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse20 (bvadd (_ bv4 32) .cse20))))))) is different from true [2023-11-29 03:42:53,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:53,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 37 treesize of output 37 [2023-11-29 03:42:54,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:54,033 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 49 treesize of output 46 [2023-11-29 03:42:54,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:54,060 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 20 treesize of output 24 [2023-11-29 03:42:54,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:54,175 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 29 treesize of output 30 [2023-11-29 03:42:54,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:54,201 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 35 treesize of output 36 [2023-11-29 03:42:54,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:54,295 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 62 treesize of output 56 [2023-11-29 03:42:54,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:54,321 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 20 treesize of output 24 [2023-11-29 03:42:54,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:54,444 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 33 treesize of output 33 [2023-11-29 03:42:54,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:54,473 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 39 treesize of output 39 [2023-11-29 03:42:54,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:54,574 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 31 treesize of output 32 [2023-11-29 03:42:54,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:54,633 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 16 treesize of output 20 [2023-11-29 03:42:54,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:54,653 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 22 treesize of output 26 [2023-11-29 03:42:54,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:54,739 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 46 treesize of output 43 [2023-11-29 03:42:54,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:54,764 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 39 treesize of output 39 [2023-11-29 03:42:54,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:54,886 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 46 treesize of output 43 [2023-11-29 03:42:54,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:54,913 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 22 treesize of output 26 [2023-11-29 03:42:55,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:55,021 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 29 treesize of output 30 [2023-11-29 03:42:55,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:55,045 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 41 treesize of output 41 [2023-11-29 03:42:55,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:55,147 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 33 treesize of output 33 [2023-11-29 03:42:55,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:42:55,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2023-11-29 03:42:55,273 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_28) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))) (not (= (select v_prenex_14 (_ bv0 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_33)) (.cse3 (select v_arrayElimArr_33 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse1 (select (select (store .cse2 .cse3 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (_ bv0 32) (select v_arrayElimArr_34 |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse1 (_ bv0 32)) (= .cse1 (select (select (store .cse2 .cse3 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_34) .cse3 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) .cse4) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_20)) (.cse5 (select v_arrayElimArr_20 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse6 (select (select (store .cse7 .cse5 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_21) .cse5 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (= .cse6 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (= (select (select (store .cse7 .cse5 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (= .cse6 (_ bv0 32)))))) (forall ((v_arrayElimArr_31 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_31)) (.cse11 (select v_arrayElimArr_31 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_32) .cse11 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse9 (select (select (store .cse10 .cse11 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (bvadd (_ bv4 32) .cse8) (_ bv0 32)) (= .cse8 (_ bv0 32)) (= .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (= (select (select (store .cse10 .cse11 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse9) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select v_arrayElimArr_37 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_37) .cse13 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse12 |c_ULTIMATE.start_main_~x~0#1.base|) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_38) .cse13 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse4) (= .cse12 (_ bv0 32)) (not (= (select v_arrayElimArr_38 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select v_arrayElimArr_22 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_22))) (= (select (select (store .cse14 .cse15 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse14 .cse15 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_arrayElimArr_23 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (not (= (select v_prenex_14 (_ bv0 32)) (_ bv0 32))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_23) .cse15 v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse16 (bvadd (_ bv4 32) .cse16)))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select v_arrayElimArr_26 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_27) .cse19 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_26))) (or (= .cse17 (_ bv0 32)) (= (bvadd .cse17 (_ bv4 32)) (_ bv0 32)) (= (select (select (store .cse18 .cse19 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse18 .cse19 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 32) (select v_arrayElimArr_27 |c_ULTIMATE.start_main_~x~0#1.offset|))) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select v_arrayElimArr_35 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_36) .cse21 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_35))) (= (select (select (store .cse20 .cse21 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse20 .cse21 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (= .cse22 (_ bv0 32)) (not (= (select v_arrayElimArr_36 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))) (bvule (bvadd (_ bv4 32) .cse22) .cse4))))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select v_arrayElimArr_30 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_30) .cse23 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse4) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_29) .cse23 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))))) (forall ((v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_19) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse24 (_ bv0 32)) (bvule (bvadd (_ bv4 32) .cse24) .cse4) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_19 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_24)) (.cse27 (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse25 (select (select (store .cse26 .cse27 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse25 (select (select (store .cse26 .cse27 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse25 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (= .cse25 (_ bv0 32)) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_25) .cse27 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)))))))) is different from false [2023-11-29 03:42:59,287 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_28) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))) (not (= (select v_prenex_14 (_ bv0 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_33)) (.cse3 (select v_arrayElimArr_33 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse1 (select (select (store .cse2 .cse3 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (_ bv0 32) (select v_arrayElimArr_34 |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse1 (_ bv0 32)) (= .cse1 (select (select (store .cse2 .cse3 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_34) .cse3 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) .cse4) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_20)) (.cse5 (select v_arrayElimArr_20 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse6 (select (select (store .cse7 .cse5 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_21) .cse5 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (= .cse6 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (= (select (select (store .cse7 .cse5 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (= .cse6 (_ bv0 32)))))) (forall ((v_arrayElimArr_31 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_31)) (.cse11 (select v_arrayElimArr_31 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_32) .cse11 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse9 (select (select (store .cse10 .cse11 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (bvadd (_ bv4 32) .cse8) (_ bv0 32)) (= .cse8 (_ bv0 32)) (= .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (= (select (select (store .cse10 .cse11 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse9) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select v_arrayElimArr_37 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_37) .cse13 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse12 |c_ULTIMATE.start_main_~x~0#1.base|) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_38) .cse13 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse4) (= .cse12 (_ bv0 32)) (not (= (select v_arrayElimArr_38 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select v_arrayElimArr_22 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_22))) (= (select (select (store .cse14 .cse15 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse14 .cse15 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_arrayElimArr_23 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (not (= (select v_prenex_14 (_ bv0 32)) (_ bv0 32))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_23) .cse15 v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse16 (bvadd (_ bv4 32) .cse16)))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select v_arrayElimArr_26 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_27) .cse19 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_26))) (or (= .cse17 (_ bv0 32)) (= (bvadd .cse17 (_ bv4 32)) (_ bv0 32)) (= (select (select (store .cse18 .cse19 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse18 .cse19 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 32) (select v_arrayElimArr_27 |c_ULTIMATE.start_main_~x~0#1.offset|))) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select v_arrayElimArr_35 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_36) .cse21 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_35))) (= (select (select (store .cse20 .cse21 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse20 .cse21 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (= .cse22 (_ bv0 32)) (not (= (select v_arrayElimArr_36 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))) (bvule (bvadd (_ bv4 32) .cse22) .cse4))))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select v_arrayElimArr_30 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_30) .cse23 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse4) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_29) .cse23 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))))) (forall ((v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_19) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse24 (_ bv0 32)) (bvule (bvadd (_ bv4 32) .cse24) .cse4) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_19 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_24)) (.cse27 (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse25 (select (select (store .cse26 .cse27 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse25 (select (select (store .cse26 .cse27 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse25 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (= .cse25 (_ bv0 32)) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_25) .cse27 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)))))))) is different from true [2023-11-29 03:43:01,174 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse3 (bvadd (_ bv4 32) .cse4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select v_arrayElimArr_37 .cse4))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_37) .cse2 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse0 .cse1) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_38) .cse2 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse3) (not (= (select v_arrayElimArr_38 .cse4) (_ bv0 32))) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (= .cse1 (_ bv0 32)))))) (forall ((v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_19) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse5 (_ bv0 32)) (not (= (select v_arrayElimArr_19 .cse4) (_ bv0 32))) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (bvule (bvadd (_ bv4 32) .cse5) .cse3)))) (forall ((v_arrayElimArr_31 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_31)) (.cse8 (select v_arrayElimArr_31 .cse4))) (let ((.cse6 (select (select (store .cse7 .cse8 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse9 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_32) .cse8 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse6 (select (select (store .cse7 .cse8 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse9 (_ bv0 32)) (not (= (select v_arrayElimArr_32 .cse4) (_ bv0 32))) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (= .cse0 .cse6) (= (bvadd (_ bv4 32) .cse9) (_ bv0 32)) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_28 .cse4))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_28) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse10 (bvadd (_ bv4 32) .cse10))) (not (= (select v_prenex_14 (_ bv0 32)) (_ bv0 32))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select v_arrayElimArr_22 .cse4))) (or (not (= (select v_arrayElimArr_23 .cse4) (_ bv0 32))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_23) .cse12 v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse11 (bvadd (_ bv4 32) .cse11))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_22))) (= (select (select (store .cse13 .cse12 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse13 .cse12 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_prenex_14 (_ bv0 32)) (_ bv0 32)))))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select v_arrayElimArr_29 .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_29) .cse14 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_30 .cse4) (_ bv0 32))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_30) .cse14 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse3)))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select v_arrayElimArr_35 .cse4))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_36) .cse17 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (select v_arrayElimArr_36 .cse4) (_ bv0 32))) (bvule (bvadd (_ bv4 32) .cse15) .cse3) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_35))) (= (select (select (store .cse16 .cse17 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse16 .cse17 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (= .cse15 (_ bv0 32)) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_20)) (.cse19 (select v_arrayElimArr_20 .cse4))) (let ((.cse18 (select (select (store .cse20 .cse19 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse18 (_ bv0 32)) (= (_ bv0 32) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_21) .cse19 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_21 .cse4) (_ bv0 32))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (= .cse0 (select (select (store .cse20 .cse19 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse0 .cse18))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select v_arrayElimArr_26 .cse4))) (let ((.cse22 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_26)) (.cse21 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_27) .cse23 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse21 (_ bv0 32)) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (= .cse0 (select (select (store .cse22 .cse23 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_arrayElimArr_27 .cse4) (_ bv0 32))) (= .cse0 (select (select (store .cse22 .cse23 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))) (= (bvadd (_ bv4 32) .cse21) (_ bv0 32)))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_24)) (.cse24 (select v_arrayElimArr_24 .cse4))) (let ((.cse25 (select (select (store .cse26 .cse24 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_25) .cse24 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (_ bv0 32)) (= .cse25 (select (select (store .cse26 .cse24 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse25 .cse0) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (= .cse25 (_ bv0 32)) (not (= (select v_arrayElimArr_25 .cse4) (_ bv0 32))))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_33)) (.cse28 (select v_arrayElimArr_33 .cse4))) (let ((.cse27 (select (select (store .cse29 .cse28 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse27 (_ bv0 32)) (not (= (select v_arrayElimArr_34 .cse4) (_ bv0 32))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_34) .cse28 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse3) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (= .cse27 (select (select (store .cse29 .cse28 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))) is different from false [2023-11-29 03:43:05,189 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse3 (bvadd (_ bv4 32) .cse4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select v_arrayElimArr_37 .cse4))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_37) .cse2 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse0 .cse1) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_38) .cse2 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse3) (not (= (select v_arrayElimArr_38 .cse4) (_ bv0 32))) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (= .cse1 (_ bv0 32)))))) (forall ((v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_19) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse5 (_ bv0 32)) (not (= (select v_arrayElimArr_19 .cse4) (_ bv0 32))) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (bvule (bvadd (_ bv4 32) .cse5) .cse3)))) (forall ((v_arrayElimArr_31 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_31)) (.cse8 (select v_arrayElimArr_31 .cse4))) (let ((.cse6 (select (select (store .cse7 .cse8 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse9 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_32) .cse8 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse6 (select (select (store .cse7 .cse8 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse9 (_ bv0 32)) (not (= (select v_arrayElimArr_32 .cse4) (_ bv0 32))) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (= .cse0 .cse6) (= (bvadd (_ bv4 32) .cse9) (_ bv0 32)) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_28 .cse4))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_28) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse10 (bvadd (_ bv4 32) .cse10))) (not (= (select v_prenex_14 (_ bv0 32)) (_ bv0 32))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select v_arrayElimArr_22 .cse4))) (or (not (= (select v_arrayElimArr_23 .cse4) (_ bv0 32))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_23) .cse12 v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse11 (bvadd (_ bv4 32) .cse11))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_22))) (= (select (select (store .cse13 .cse12 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse13 .cse12 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_prenex_14 (_ bv0 32)) (_ bv0 32)))))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select v_arrayElimArr_29 .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_29) .cse14 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_30 .cse4) (_ bv0 32))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_30) .cse14 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse3)))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select v_arrayElimArr_35 .cse4))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_36) .cse17 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (select v_arrayElimArr_36 .cse4) (_ bv0 32))) (bvule (bvadd (_ bv4 32) .cse15) .cse3) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_35))) (= (select (select (store .cse16 .cse17 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse16 .cse17 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (= .cse15 (_ bv0 32)) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_20)) (.cse19 (select v_arrayElimArr_20 .cse4))) (let ((.cse18 (select (select (store .cse20 .cse19 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse18 (_ bv0 32)) (= (_ bv0 32) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_21) .cse19 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_21 .cse4) (_ bv0 32))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (= .cse0 (select (select (store .cse20 .cse19 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse0 .cse18))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select v_arrayElimArr_26 .cse4))) (let ((.cse22 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_26)) (.cse21 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_27) .cse23 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse21 (_ bv0 32)) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (= .cse0 (select (select (store .cse22 .cse23 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_arrayElimArr_27 .cse4) (_ bv0 32))) (= .cse0 (select (select (store .cse22 .cse23 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))) (= (bvadd (_ bv4 32) .cse21) (_ bv0 32)))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_24)) (.cse24 (select v_arrayElimArr_24 .cse4))) (let ((.cse25 (select (select (store .cse26 .cse24 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_25) .cse24 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (_ bv0 32)) (= .cse25 (select (select (store .cse26 .cse24 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse25 .cse0) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (= .cse25 (_ bv0 32)) (not (= (select v_arrayElimArr_25 .cse4) (_ bv0 32))))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_33)) (.cse28 (select v_arrayElimArr_33 .cse4))) (let ((.cse27 (select (select (store .cse29 .cse28 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse27 (_ bv0 32)) (not (= (select v_arrayElimArr_34 .cse4) (_ bv0 32))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_34) .cse28 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse3) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (= .cse27 (select (select (store .cse29 .cse28 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))) is different from true [2023-11-29 03:43:05,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:43:05,327 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 49 treesize of output 41 [2023-11-29 03:43:05,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:43:05,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 47 treesize of output 39 [2023-11-29 03:43:05,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:43:05,452 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 135 treesize of output 134 [2023-11-29 03:43:05,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:43:05,530 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 193 treesize of output 188 [2023-11-29 03:43:05,563 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 56 treesize of output 52 [2023-11-29 03:43:05,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:43:05,622 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 221 treesize of output 197 [2023-11-29 03:43:05,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:43:05,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 107 [2023-11-29 03:43:05,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:43:05,740 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 55 treesize of output 57 [2023-11-29 03:43:05,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:43:05,805 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 31 treesize of output 33 [2023-11-29 03:43:06,529 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:43:06,530 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 47 treesize of output 1 [2023-11-29 03:43:06,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:43:06,560 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 25 treesize of output 26 [2023-11-29 03:43:06,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:43:06,588 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 70 treesize of output 54 [2023-11-29 03:43:06,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:43:06,599 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:43:06,605 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 12 [2023-11-29 03:43:06,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:43:06,632 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 14 treesize of output 18 [2023-11-29 03:43:06,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:43:06,682 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 186 treesize of output 181 [2023-11-29 03:43:06,725 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 03:43:06,725 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 136 treesize of output 114 [2023-11-29 03:43:06,740 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 46 treesize of output 42 [2023-11-29 03:43:06,830 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 03:43:06,871 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:43:06,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 1 [2023-11-29 03:43:06,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:43:06,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 34 [2023-11-29 03:43:06,894 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:43:06,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:43:06,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:43:06,903 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2023-11-29 03:43:06,914 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 6 treesize of output 4 [2023-11-29 03:43:06,951 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:43:06,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 1 [2023-11-29 03:43:06,974 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:43:06,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 1 [2023-11-29 03:43:07,000 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:43:07,000 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 49 treesize of output 1 [2023-11-29 03:43:07,025 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:43:07,026 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 51 treesize of output 1 [2023-11-29 03:43:07,057 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 03:43:07,058 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 27 treesize of output 1 [2023-11-29 03:43:19,810 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 03:43:19,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:43:19,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833506319] [2023-11-29 03:43:19,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833506319] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:43:19,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:43:19,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 29 [2023-11-29 03:43:19,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260640161] [2023-11-29 03:43:19,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:43:19,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 03:43:19,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:43:19,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 03:43:19,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=598, Unknown=18, NotChecked=212, Total=930 [2023-11-29 03:43:19,812 INFO L87 Difference]: Start difference. First operand 223 states and 284 transitions. Second operand has 31 states, 30 states have (on average 1.6) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 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:43:25,451 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse26 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse4 (select .cse12 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) .cse4)) (.cse0 (select .cse26 |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select v_arrayElimArr_37 .cse4))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_37) .cse2 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse0 .cse1) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_38) .cse2 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse3) (not (= (select v_arrayElimArr_38 .cse4) (_ bv0 32))) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (= .cse1 (_ bv0 32)))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_19) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse5 (_ bv0 32)) (not (= (select v_arrayElimArr_19 .cse4) (_ bv0 32))) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (bvule (bvadd (_ bv4 32) .cse5) .cse3)))) (bvule |c_ULTIMATE.start_main_~x~0#1.offset| .cse6) (forall ((v_arrayElimArr_31 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_31)) (.cse9 (select v_arrayElimArr_31 .cse4))) (let ((.cse7 (select (select (store .cse8 .cse9 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse10 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_32) .cse9 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse7 (select (select (store .cse8 .cse9 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse10 (_ bv0 32)) (not (= (select v_arrayElimArr_32 .cse4) (_ bv0 32))) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (= .cse0 .cse7) (= (bvadd (_ bv4 32) .cse10) (_ bv0 32)) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_28 .cse4))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_28) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse11 (bvadd (_ bv4 32) .cse11))) (not (= (select v_prenex_14 (_ bv0 32)) (_ bv0 32))))) (= (select .cse12 (_ bv0 32)) (_ bv0 32)) (= |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select v_arrayElimArr_22 .cse4))) (or (not (= (select v_arrayElimArr_23 .cse4) (_ bv0 32))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_23) .cse14 v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse13 (bvadd (_ bv4 32) .cse13))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_22))) (= (select (select (store .cse15 .cse14 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse15 .cse14 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_prenex_14 (_ bv0 32)) (_ bv0 32)))))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select v_arrayElimArr_29 .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_29) .cse16 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_30 .cse4) (_ bv0 32))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_30) .cse16 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse3)))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select v_arrayElimArr_35 .cse4))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_36) .cse19 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (select v_arrayElimArr_36 .cse4) (_ bv0 32))) (bvule (bvadd (_ bv4 32) .cse17) .cse3) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_35))) (= (select (select (store .cse18 .cse19 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse18 .cse19 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (= .cse17 (_ bv0 32)) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_20)) (.cse21 (select v_arrayElimArr_20 .cse4))) (let ((.cse20 (select (select (store .cse22 .cse21 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse20 (_ bv0 32)) (= (_ bv0 32) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_21) .cse21 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_21 .cse4) (_ bv0 32))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (= .cse0 (select (select (store .cse22 .cse21 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse0 .cse20))))) (bvule .cse6 (select |c_#length| |c_ULTIMATE.start_main_~x~0#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select v_arrayElimArr_26 .cse4))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_26)) (.cse23 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_27) .cse25 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse23 (_ bv0 32)) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (= .cse0 (select (select (store .cse24 .cse25 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_arrayElimArr_27 .cse4) (_ bv0 32))) (= .cse0 (select (select (store .cse24 .cse25 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))) (= (bvadd (_ bv4 32) .cse23) (_ bv0 32)))))) (not (= (select .cse26 (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_24)) (.cse27 (select v_arrayElimArr_24 .cse4))) (let ((.cse28 (select (select (store .cse29 .cse27 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_25) .cse27 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (_ bv0 32)) (= .cse28 (select (select (store .cse29 .cse27 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse28 .cse0) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (= .cse28 (_ bv0 32)) (not (= (select v_arrayElimArr_25 .cse4) (_ bv0 32))))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_33)) (.cse31 (select v_arrayElimArr_33 .cse4))) (let ((.cse30 (select (select (store .cse32 .cse31 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse30 (_ bv0 32)) (not (= (select v_arrayElimArr_34 .cse4) (_ bv0 32))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_34) .cse31 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse3) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (= .cse30 (select (select (store .cse32 .cse31 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))) is different from true [2023-11-29 03:43:29,838 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_28) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))) (not (= (select v_prenex_14 (_ bv0 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_28 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) (_ bv0 32)) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_33)) (.cse3 (select v_arrayElimArr_33 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse1 (select (select (store .cse2 .cse3 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (_ bv0 32) (select v_arrayElimArr_34 |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse1 (_ bv0 32)) (= .cse1 (select (select (store .cse2 .cse3 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_34) .cse3 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) .cse4) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_20)) (.cse5 (select v_arrayElimArr_20 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse6 (select (select (store .cse7 .cse5 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_21) .cse5 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (= .cse6 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (= (select (select (store .cse7 .cse5 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (= .cse6 (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| .cse8)) (= .cse8 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimArr_31 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_31)) (.cse12 (select v_arrayElimArr_31 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_32) .cse12 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse10 (select (select (store .cse11 .cse12 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (bvadd (_ bv4 32) .cse9) (_ bv0 32)) (= .cse9 (_ bv0 32)) (= .cse10 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (= (select (select (store .cse11 .cse12 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse10) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select v_arrayElimArr_37 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_37) .cse14 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse13 |c_ULTIMATE.start_main_~x~0#1.base|) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_38) .cse14 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse4) (= .cse13 (_ bv0 32)) (not (= (select v_arrayElimArr_38 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select v_arrayElimArr_22 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_22))) (= (select (select (store .cse15 .cse16 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse15 .cse16 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_arrayElimArr_23 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (not (= (select v_prenex_14 (_ bv0 32)) (_ bv0 32))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_23) .cse16 v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse17 (bvadd (_ bv4 32) .cse17)))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select v_arrayElimArr_26 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_27) .cse20 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse19 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_26))) (or (= .cse18 (_ bv0 32)) (= (bvadd .cse18 (_ bv4 32)) (_ bv0 32)) (= (select (select (store .cse19 .cse20 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse19 .cse20 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 32) (select v_arrayElimArr_27 |c_ULTIMATE.start_main_~x~0#1.offset|))) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select v_arrayElimArr_35 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_36) .cse22 v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (let ((.cse21 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_35))) (= (select (select (store .cse21 .cse22 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse21 .cse22 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (= .cse23 (_ bv0 32)) (not (= (select v_arrayElimArr_36 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))) (bvule (bvadd (_ bv4 32) .cse23) .cse4))))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select v_arrayElimArr_30 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_30) .cse24 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse4) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_29) .cse24 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))))) (forall ((v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_19) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse25 (_ bv0 32)) (bvule (bvadd (_ bv4 32) .cse25) .cse4) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_19 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_24)) (.cse28 (select v_arrayElimArr_24 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse26 (select (select (store .cse27 .cse28 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse26 (select (select (store .cse27 .cse28 v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse26 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (= .cse26 (_ bv0 32)) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))) (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_25) .cse28 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)))))))) is different from true [2023-11-29 03:43:35,072 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32))))) (and (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse0 (select (select (store .cse2 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse0 (_ bv0 32)) (= (bvadd (_ bv4 32) (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (= (select (select (store .cse2 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse0) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse4 (select (select (store .cse6 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse4 (_ bv0 32)) (bvule (bvadd (_ bv4 32) (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse5) (= (select (select (store .cse6 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse4) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse7 (select (select (store .cse8 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse7 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse7 (_ bv0 32)) (= (bvadd (_ bv4 32) (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (= (select (select (store .cse8 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (or (= (select (select (store .cse9 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse10 (_ bv0 32)) (= (bvadd (_ bv4 32) .cse10) (_ bv0 32)) (= (select (select (store .cse9 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) (_ bv0 32)) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse11 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse11 (_ bv0 32)) (bvule (bvadd (_ bv4 32) (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse5) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32)))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse12 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse13 (select (select (store .cse14 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse12 (_ bv0 32)) (= (bvadd (_ bv4 32) .cse12) (_ bv0 32)) (= .cse13 (select (select (store .cse14 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse13 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32))))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| .cse15)) (= .cse15 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (= (select (select (store .cse16 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse16 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_prenex_14 (_ bv0 32)) (_ bv0 32))) (let ((.cse17 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse17 (bvadd (_ bv4 32) .cse17))))) (forall ((v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (let ((.cse18 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (bvule (bvadd (_ bv4 32) .cse18) .cse5) (= .cse18 (_ bv0 32)) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (bvule (bvadd (_ bv4 32) (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse5) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv0 32)))) (not (= (select v_arrayElimArr_18 (_ bv0 32)) (_ bv0 32))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (bvule (bvadd (_ bv4 32) .cse19) .cse5) (= .cse19 (_ bv0 32)) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (= (select (select (store .cse20 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse20 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_prenex_12 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_13 (_ bv0 32)) (_ bv0 32)))))) (forall ((v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (or (not (= (select v_prenex_14 (_ bv0 32)) (_ bv0 32))) (let ((.cse21 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse21 (bvadd (_ bv4 32) .cse21))))))) is different from true [2023-11-29 03:43:39,778 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32))) (.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_17 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (bvule (bvadd (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) .cse2))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|))) (.cse4 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse4 (_ bv0 32)) (not (= (select v_prenex_13 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (= (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (_ bv0 32) (bvadd (_ bv4 32) .cse4)) (not (= (select v_prenex_12 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32)))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse5 (select (select (store .cse6 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse5 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_17 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (= (bvadd (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (_ bv0 32)) (= (select (select (store .cse6 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse5) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (= (select (select (store .cse7 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse7 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_prenex_14 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (let ((.cse8 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse8 (bvadd (_ bv4 32) .cse8))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse9 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_17 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (bvule (bvadd (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) .cse2)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| .cse10)) (= .cse10 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse11 (select (select (store .cse12 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse11 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse11 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_17 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (= (bvadd (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (_ bv0 32)) (= (select (select (store .cse12 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))))))) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse13 (_ bv0 32)) (not (= (select v_prenex_13 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (= (select (select (store .cse14 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse14 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse13) .cse2) (not (= (select v_prenex_12 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32)))))) (forall ((v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (let ((.cse15 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse15 (_ bv0 32)) (bvule (bvadd (_ bv4 32) .cse15) .cse2) (not (= (select v_prenex_12 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32)))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.offset| (_ bv0 32)) (forall ((v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (or (not (= (select v_prenex_14 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (let ((.cse16 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_14) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse16 (bvadd (_ bv4 32) .cse16))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse18 (select (select (store .cse19 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse17 (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse17 (_ bv0 32)) (not (= (select v_prenex_13 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (= .cse18 (select (select (store .cse19 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse18 |c_ULTIMATE.start_main_~x~0#1.base|) (= (_ bv0 32) (bvadd (_ bv4 32) .cse17)) (not (= (select v_prenex_12 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse20 (select (select (store .cse21 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse20 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_17 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (= (select (select (store .cse21 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse20) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (bvule (bvadd (select (select (store .cse1 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) .cse2))))))) is different from true [2023-11-29 03:43:55,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:43:57,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:43:59,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:44:01,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:44:04,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:44:14,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:44:17,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:44:21,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:44:24,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:44:28,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:44:30,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:45:53,821 WARN L293 SmtUtils]: Spent 11.97s on a formula simplification. DAG size of input: 273 DAG size of output: 213 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:45:58,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:45:59,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:46:03,906 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 [0, 1] [2023-11-29 03:46:06,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:46:09,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:46:12,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:46:18,462 WARN L293 SmtUtils]: Spent 5.25s on a formula simplification. DAG size of input: 165 DAG size of output: 135 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:47:32,466 WARN L293 SmtUtils]: Spent 12.77s on a formula simplification. DAG size of input: 281 DAG size of output: 219 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:47:39,119 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse26 (select (select |c_#memory_$Pointer$#1.base| (_ bv0 32)) (_ bv0 32))) (.cse31 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse30 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse0 (select .cse30 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (select .cse31 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse29 (exists ((v_arrayElimIndex_10 (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#1.base| v_arrayElimIndex_10) (_ bv0 32)) v_arrayElimIndex_10))) (.cse12 (= .cse26 (_ bv0 32))) (.cse23 (exists ((v_arrayElimCell_112 (_ BitVec 32))) (and (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)) .cse26)))) (.cse24 (= (select (select |c_#memory_$Pointer$#1.offset| (_ bv0 32)) (_ bv0 32)) (_ bv0 32))) (.cse13 (exists ((v_arrayElimCell_112 (_ BitVec 32))) (and (not (= v_arrayElimCell_112 (_ bv0 32))) (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32)))))) (and (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse0))) (= (_ bv0 32) .cse1) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (or (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| .cse1)) (not (= (select v_arrayElimArr_18 .cse0) (_ bv0 32)))))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))) (not (= (select v_arrayElimArr_18 .cse0) (_ bv0 32))))) (bvule |c_ULTIMATE.start_main_~x~0#1.offset| .cse4) (= |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)) (let ((.cse10 (select .cse31 (_ bv0 32)))) (let ((.cse14 (= (_ bv0 32) |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse15 (= .cse10 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| .cse10) (_ bv0 32))) (.cse21 (= (select (select |c_#memory_$Pointer$#1.offset| .cse10) (_ bv0 32)) (_ bv0 32))) (.cse20 (bvule (_ bv4 32) (select |c_#length| .cse10))) (.cse19 (not .cse15)) (.cse7 (exists ((v_arrayElimCell_112 (_ BitVec 32))) (and (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32)) (not (= v_arrayElimCell_112 |c_ULTIMATE.start_main_~x~0#1.base|))))) (.cse28 (and .cse13 .cse14)) (.cse5 (= (select .cse30 (_ bv0 32)) (_ bv0 32))) (.cse6 (= .cse10 (_ bv0 32)))) (or (and .cse5 .cse6 (or .cse7 (exists ((v_arrayElimIndex_10 (_ BitVec 32))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimIndex_10) (_ bv0 32)))) (and (exists ((v_arrayElimCell_112 (_ BitVec 32))) (and (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32)) (= .cse8 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32))) (not (= v_arrayElimCell_112 |c_ULTIMATE.start_main_~x~0#1.base|)))) (= .cse8 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimIndex_10) (_ bv0 32)) (_ bv0 32)) (not (= v_arrayElimIndex_10 |c_ULTIMATE.start_main_~x~0#1.base|))))) (exists ((v_arrayElimIndex_10 (_ BitVec 32))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimIndex_10) (_ bv0 32)))) (and (exists ((v_arrayElimCell_112 (_ BitVec 32))) (and (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32)) (= .cse9 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32))) (not (= v_arrayElimCell_112 |c_ULTIMATE.start_main_~x~0#1.base|)))) (= .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_arrayElimIndex_10 |c_ULTIMATE.start_main_~x~0#1.base|))))) (exists ((v_arrayElimIndex_10 (_ BitVec 32))) (and (= (select (select |c_#memory_$Pointer$#1.base| v_arrayElimIndex_10) (_ bv0 32)) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimIndex_10) (_ bv0 32)) (_ bv0 32)) (bvule (_ bv4 32) (select |c_#length| v_arrayElimIndex_10)) (not (= v_arrayElimIndex_10 |c_ULTIMATE.start_main_~x~0#1.base|)))))) (and .cse5 (let ((.cse16 (exists ((v_arrayElimCell_112 (_ BitVec 32))) (and (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32)) (not (= v_arrayElimCell_112 |c_ULTIMATE.start_main_~x~0#1.base|)) (= .cse10 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)))))) (.cse17 (= .cse11 (_ bv0 32)))) (or (and (= .cse10 .cse11) (or (and .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17) (exists ((v_arrayElimCell_112 (_ BitVec 32))) (let ((.cse18 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse18) (_ bv0 32)) (_ bv0 32)) (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= .cse18 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32)) (not (= v_arrayElimCell_112 |c_ULTIMATE.start_main_~x~0#1.base|))))))) (and (or (and .cse19 .cse20) (and .cse15 .cse16)) .cse21 .cse17)))) (and (let ((.cse22 (= .cse26 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (and .cse5 (or (and .cse22 .cse23 .cse6 .cse24) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse11) (_ bv0 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse11) (_ bv0 32)) (_ bv0 32)) .cse21 .cse20) (and .cse22 .cse23 .cse6) (exists ((v_arrayElimCell_112 (_ BitVec 32))) (let ((.cse25 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse25) (_ bv0 32)) (_ bv0 32)) (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= .cse25 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32))))))) (and (or (and .cse22 .cse23 .cse24) (exists ((v_arrayElimCell_112 (_ BitVec 32))) (and (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32)))) (and .cse22 .cse23)) .cse5 .cse6))) .cse19) (and (or .cse7 (exists ((v_arrayElimCell_112 (_ BitVec 32))) (let ((.cse27 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse27) (_ bv0 32)) .cse27) (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= .cse27 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32)) (not (= v_arrayElimCell_112 |c_ULTIMATE.start_main_~x~0#1.base|))))) .cse28 (and .cse7 .cse29)) .cse5 .cse6) (and .cse12 (or .cse7 .cse28) .cse5 .cse6))))) (bvule .cse4 (select |c_#length| |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (bvule (bvadd (_ bv4 32) .cse32) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= .cse32 (_ bv0 32)) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))))) (not (= (select v_arrayElimArr_17 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse33 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse33 (bvadd (_ bv4 32) .cse33))) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (select v_arrayElimArr_17 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (or (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| .cse34)) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (= .cse34 (_ bv0 32))))) (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse0))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse35 (_ bv0 32)) (bvule (bvadd (_ bv4 32) .cse35) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_arrayElimArr_18 .cse0) (_ bv0 32)))))))) (let ((.cse44 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)))) (let ((.cse49 (= |c_ULTIMATE.start_main_~head~0#1.base| .cse44)) (.cse46 (= |c_ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))) (let ((.cse38 (and .cse13 .cse46)) (.cse37 (exists ((v_arrayElimCell_112 (_ BitVec 32))) (and (not (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_112)) (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32))))) (.cse52 (not .cse49)) (.cse40 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) (_ bv0 32))) (.cse50 (= (select (select |c_#memory_$Pointer$#1.offset| .cse44) (_ bv0 32)) (_ bv0 32))) (.cse51 (bvule (_ bv4 32) (select |c_#length| .cse44))) (.cse43 (select (select |c_#memory_$Pointer$#1.base| .cse44) (_ bv0 32))) (.cse39 (= (_ bv0 32) .cse44))) (or (and (or (exists ((v_arrayElimCell_112 (_ BitVec 32))) (let ((.cse36 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse36) (_ bv0 32)) .cse36) (not (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_112)) (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse36) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32))))) (and .cse29 .cse37) .cse38 .cse37) .cse39 .cse40) (and .cse39 .cse40 (or .cse38 .cse37) .cse12) (and .cse39 .cse40 (or (exists ((v_arrayElimIndex_10 (_ BitVec 32))) (let ((.cse41 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimIndex_10) (_ bv0 32)))) (and (not (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimIndex_10)) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimIndex_10) (_ bv0 32)) (_ bv0 32)) (= .cse41 |c_ULTIMATE.start_main_~head~0#1.base|) (exists ((v_arrayElimCell_112 (_ BitVec 32))) (and (not (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_112)) (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32)) (= .cse41 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)))))))) (exists ((v_arrayElimIndex_10 (_ BitVec 32))) (and (not (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimIndex_10)) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimIndex_10) (_ bv0 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$#1.base| v_arrayElimIndex_10) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvule (_ bv4 32) (select |c_#length| v_arrayElimIndex_10)))) (exists ((v_arrayElimIndex_10 (_ BitVec 32))) (let ((.cse42 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimIndex_10) (_ bv0 32)))) (and (not (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimIndex_10)) (= .cse42 |c_ULTIMATE.start_main_~head~0#1.base|) (exists ((v_arrayElimCell_112 (_ BitVec 32))) (and (not (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_112)) (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32)) (= .cse42 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)))))))) .cse37)) (and .cse40 (let ((.cse47 (= .cse43 (_ bv0 32))) (.cse48 (exists ((v_arrayElimCell_112 (_ BitVec 32))) (and (not (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_112)) (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)) .cse44))))) (or (and (= .cse43 .cse44) (or (exists ((v_arrayElimCell_112 (_ BitVec 32))) (let ((.cse45 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)))) (and (not (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_112)) (= (select (select |c_#memory_$Pointer$#1.base| .cse45) (_ bv0 32)) (_ bv0 32)) (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse45) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32))))) (and .cse12 .cse13 .cse46) (and .cse47 .cse48 .cse49))) (and .cse50 .cse47 (or (and .cse51 .cse52) (and .cse48 .cse49)))))) (and .cse52 (let ((.cse53 (= |c_ULTIMATE.start_main_~head~0#1.base| .cse26))) (or (and .cse39 .cse40 (or (and .cse53 .cse23) (exists ((v_arrayElimCell_112 (_ BitVec 32))) (and (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32)))) (and .cse53 .cse23 .cse24))) (and .cse40 (or (and .cse53 .cse39 .cse23) (exists ((v_arrayElimCell_112 (_ BitVec 32))) (let ((.cse54 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse54) (_ bv0 32)) (_ bv0 32)) (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse54) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32))))) (and .cse50 .cse51 (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.base| .cse43) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse43) (_ bv0 32)) (_ bv0 32))) (and .cse53 .cse39 .cse23 .cse24))))))))))))) is different from false [2023-11-29 03:47:43,843 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse39 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse5 (select .cse39 (_ bv0 32))) (.cse0 (select .cse10 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (select .cse39 |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse0))) (= (_ bv0 32) .cse1) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (or (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| .cse1)) (not (= (select v_arrayElimArr_18 .cse0) (_ bv0 32)))))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))) (not (= (select v_arrayElimArr_18 .cse0) (_ bv0 32))))) (bvule |c_ULTIMATE.start_main_~x~0#1.offset| .cse4) (= |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)) (not (= .cse5 (_ bv0 32))) (bvule .cse4 (select |c_#length| |c_ULTIMATE.start_main_~x~0#1.base|)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| .cse5) (_ bv0 32))) (.cse6 (= (select .cse10 (_ bv0 32)) (_ bv0 32))) (.cse7 (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) (_ bv0 32)) (_ bv0 32))) (.cse9 (bvule (_ bv4 32) (select |c_#length| .cse5)))) (or (and .cse6 .cse7 (= .cse8 (_ bv0 32)) .cse9) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse8) (_ bv0 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) (_ bv0 32)) (_ bv0 32)) .cse6 .cse7 .cse9))) (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (bvule (bvadd (_ bv4 32) .cse11) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= .cse11 (_ bv0 32)) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))))) (not (= (select v_arrayElimArr_17 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse12 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse12 (bvadd (_ bv4 32) .cse12))) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (select v_arrayElimArr_17 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (or (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| .cse13)) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (= .cse13 (_ bv0 32))))) (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse0))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse14 (_ bv0 32)) (bvule (bvadd (_ bv4 32) .cse14) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_arrayElimArr_18 .cse0) (_ bv0 32)))))))) (let ((.cse24 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)))) (let ((.cse30 (= |c_ULTIMATE.start_main_~head~0#1.base| .cse24)) (.cse38 (select (select |c_#memory_$Pointer$#1.base| (_ bv0 32)) (_ bv0 32))) (.cse26 (exists ((v_arrayElimCell_112 (_ BitVec 32))) (and (not (= v_arrayElimCell_112 (_ bv0 32))) (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32))))) (.cse27 (= |c_ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))) (let ((.cse17 (and .cse26 .cse27)) (.cse16 (exists ((v_arrayElimCell_112 (_ BitVec 32))) (and (not (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_112)) (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32))))) (.cse20 (= .cse38 (_ bv0 32))) (.cse33 (not .cse30)) (.cse19 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (_ bv0 32)) (_ bv0 32))) (.cse31 (= (select (select |c_#memory_$Pointer$#1.offset| .cse24) (_ bv0 32)) (_ bv0 32))) (.cse32 (bvule (_ bv4 32) (select |c_#length| .cse24))) (.cse23 (select (select |c_#memory_$Pointer$#1.base| .cse24) (_ bv0 32))) (.cse18 (= (_ bv0 32) .cse24))) (or (and (or (exists ((v_arrayElimCell_112 (_ BitVec 32))) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse15) (_ bv0 32)) .cse15) (not (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_112)) (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse15) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32))))) (and (exists ((v_arrayElimIndex_10 (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#1.base| v_arrayElimIndex_10) (_ bv0 32)) v_arrayElimIndex_10)) .cse16) .cse17 .cse16) .cse18 .cse19) (and .cse18 .cse19 (or .cse17 .cse16) .cse20) (and .cse18 .cse19 (or (exists ((v_arrayElimIndex_10 (_ BitVec 32))) (let ((.cse21 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimIndex_10) (_ bv0 32)))) (and (not (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimIndex_10)) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimIndex_10) (_ bv0 32)) (_ bv0 32)) (= .cse21 |c_ULTIMATE.start_main_~head~0#1.base|) (exists ((v_arrayElimCell_112 (_ BitVec 32))) (and (not (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_112)) (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32)) (= .cse21 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)))))))) (exists ((v_arrayElimIndex_10 (_ BitVec 32))) (and (not (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimIndex_10)) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimIndex_10) (_ bv0 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$#1.base| v_arrayElimIndex_10) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvule (_ bv4 32) (select |c_#length| v_arrayElimIndex_10)))) (exists ((v_arrayElimIndex_10 (_ BitVec 32))) (let ((.cse22 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimIndex_10) (_ bv0 32)))) (and (not (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimIndex_10)) (= .cse22 |c_ULTIMATE.start_main_~head~0#1.base|) (exists ((v_arrayElimCell_112 (_ BitVec 32))) (and (not (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_112)) (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32)) (= .cse22 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)))))))) .cse16)) (and .cse19 (let ((.cse28 (= .cse23 (_ bv0 32))) (.cse29 (exists ((v_arrayElimCell_112 (_ BitVec 32))) (and (not (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_112)) (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)) .cse24))))) (or (and (= .cse23 .cse24) (or (exists ((v_arrayElimCell_112 (_ BitVec 32))) (let ((.cse25 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)))) (and (not (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_112)) (= (select (select |c_#memory_$Pointer$#1.base| .cse25) (_ bv0 32)) (_ bv0 32)) (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse25) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32))))) (and .cse20 .cse26 .cse27) (and .cse28 .cse29 .cse30))) (and .cse31 .cse28 (or (and .cse32 .cse33) (and .cse29 .cse30)))))) (and .cse33 (let ((.cse34 (= |c_ULTIMATE.start_main_~head~0#1.base| .cse38)) (.cse35 (exists ((v_arrayElimCell_112 (_ BitVec 32))) (and (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)) .cse38)))) (.cse36 (= (select (select |c_#memory_$Pointer$#1.offset| (_ bv0 32)) (_ bv0 32)) (_ bv0 32)))) (or (and .cse18 .cse19 (or (and .cse34 .cse35) (exists ((v_arrayElimCell_112 (_ BitVec 32))) (and (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32)))) (and .cse34 .cse35 .cse36))) (and .cse19 (or (and .cse34 .cse18 .cse35) (exists ((v_arrayElimCell_112 (_ BitVec 32))) (let ((.cse37 (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_112) (_ bv0 32)))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse37) (_ bv0 32)) (_ bv0 32)) (bvule (_ bv4 32) (select |c_#length| v_arrayElimCell_112)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse37) (= (select (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_112) (_ bv0 32)) (_ bv0 32))))) (and .cse31 .cse32 (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.base| .cse23) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse23) (_ bv0 32)) (_ bv0 32))) (and .cse34 .cse18 .cse35 .cse36))))))))))))) is different from false [2023-11-29 03:47:55,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:48:04,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:48:04,890 INFO L93 Difference]: Finished difference Result 255 states and 310 transitions. [2023-11-29 03:48:04,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-29 03:48:04,892 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 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 24 [2023-11-29 03:48:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:48:04,893 INFO L225 Difference]: With dead ends: 255 [2023-11-29 03:48:04,893 INFO L226 Difference]: Without dead ends: 255 [2023-11-29 03:48:04,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 238.2s TimeCoverageRelationStatistics Valid=278, Invalid=1512, Unknown=56, NotChecked=910, Total=2756 [2023-11-29 03:48:04,895 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 148 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 63 mSolverCounterUnsat, 53 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 79.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 53 IncrementalHoareTripleChecker+Unknown, 890 IncrementalHoareTripleChecker+Unchecked, 82.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:48:04,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 370 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 939 Invalid, 53 Unknown, 890 Unchecked, 82.6s Time] [2023-11-29 03:48:04,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-11-29 03:48:04,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 223. [2023-11-29 03:48:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 206 states have (on average 1.3737864077669903) internal successors, (283), 222 states have internal predecessors, (283), 0 states have call successors, (0), 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:04,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 283 transitions. [2023-11-29 03:48:04,901 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 283 transitions. Word has length 24 [2023-11-29 03:48:04,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:48:04,901 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 283 transitions. [2023-11-29 03:48:04,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 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:04,901 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 283 transitions. [2023-11-29 03:48:04,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 03:48:04,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:48:04,902 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] [2023-11-29 03:48:04,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-11-29 03:48:05,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:48:05,102 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:48:05,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:48:05,103 INFO L85 PathProgramCache]: Analyzing trace with hash -93868450, now seen corresponding path program 1 times [2023-11-29 03:48:05,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:48:05,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596211354] [2023-11-29 03:48:05,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:48:05,103 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:48:05,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:48:05,104 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:48:05,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-29 03:48:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:05,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-29 03:48:05,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:48:05,343 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:48:05,683 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:06,621 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:48:06,621 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:48:07,156 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:48:07,286 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:07,867 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:48:08,405 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:08,666 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:09,593 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:48:09,593 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:48:10,160 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:10,251 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:10,294 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 20 treesize of output 15 [2023-11-29 03:48:10,420 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:11,661 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:48:11,747 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:48:12,680 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:48:12,681 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:48:19,652 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-29 03:48:19,653 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 15 treesize of output 14 [2023-11-29 03:48:19,830 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_736 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.base_166| (_ BitVec 32)) (v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_732) |v_ULTIMATE.start_main_~x~0#1.base_166| v_ArrVal_736) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (_ bv1 32))) (= |v_ULTIMATE.start_main_~x~0#1.base_166| |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2023-11-29 03:48:21,885 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_31| (_ BitVec 32))) (or (forall ((v_ArrVal_736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_730 (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_166| (_ BitVec 32)) (v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_730)) |v_ULTIMATE.start_main_#t~malloc3#1.base_31| v_ArrVal_732) |v_ULTIMATE.start_main_~x~0#1.base_166| v_ArrVal_736) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (_ bv1 32))) (= |v_ULTIMATE.start_main_~x~0#1.base_166| |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_31|) (_ bv0 1))))) is different from false [2023-11-29 03:48:22,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:48:22,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2023-11-29 03:48:22,303 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:48:22,326 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 39 treesize of output 27 [2023-11-29 03:48:22,369 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 8 treesize of output 4 [2023-11-29 03:48:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 03:48:23,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:48:23,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596211354] [2023-11-29 03:48:23,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596211354] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:48:23,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:48:23,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-11-29 03:48:23,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735667936] [2023-11-29 03:48:23,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:48:23,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 03:48:23,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:48:23,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 03:48:23,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=368, Unknown=28, NotChecked=82, Total=552 [2023-11-29 03:48:23,155 INFO L87 Difference]: Start difference. First operand 223 states and 283 transitions. Second operand has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 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:49,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:48:49,668 INFO L93 Difference]: Finished difference Result 266 states and 323 transitions. [2023-11-29 03:48:49,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 03:48:49,669 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 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:48:49,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:48:49,671 INFO L225 Difference]: With dead ends: 266 [2023-11-29 03:48:49,672 INFO L226 Difference]: Without dead ends: 266 [2023-11-29 03:48:49,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=174, Invalid=860, Unknown=30, NotChecked=126, Total=1190 [2023-11-29 03:48:49,673 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 165 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:48:49,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 400 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 856 Invalid, 0 Unknown, 288 Unchecked, 20.0s Time] [2023-11-29 03:48:49,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-11-29 03:48:49,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 232. [2023-11-29 03:48:49,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 215 states have (on average 1.3581395348837209) internal successors, (292), 231 states have internal predecessors, (292), 0 states have call successors, (0), 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:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 292 transitions. [2023-11-29 03:48:49,679 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 292 transitions. Word has length 25 [2023-11-29 03:48:49,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:48:49,679 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 292 transitions. [2023-11-29 03:48:49,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 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:49,679 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 292 transitions. [2023-11-29 03:48:49,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 03:48:49,680 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:48:49,680 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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:49,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-11-29 03:48:49,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:48:49,880 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-29 03:48:49,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:48:49,881 INFO L85 PathProgramCache]: Analyzing trace with hash -93002171, now seen corresponding path program 1 times [2023-11-29 03:48:49,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:48:49,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392801287] [2023-11-29 03:48:49,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:48:49,881 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:48:49,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:48:49,882 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/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:48:49,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04cf42e4-0a57-4bd5-9d41-4e55523a161b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-11-29 03:48:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:48:50,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 03:48:50,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:48:50,456 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 03:48:50,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2023-11-29 03:48:52,663 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 03:48:52,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2023-11-29 03:48:53,795 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:55,704 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 03:48:55,704 INFO L378 Elim1Store]: Elim1 eliminated variable 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 51 treesize of output 40 [2023-11-29 03:48:56,359 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:48:56,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2023-11-29 03:48:59,481 INFO L349 Elim1Store]: treesize reduction 56, result has 49.1 percent of original size [2023-11-29 03:48:59,481 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 5 case distinctions, treesize of input 41 treesize of output 85 [2023-11-29 03:49:01,184 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 03:49:01,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 42 [2023-11-29 03:49:01,231 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 33 treesize of output 27 [2023-11-29 03:49:03,465 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:49:03,990 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-11-29 03:49:03,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 140 [2023-11-29 03:49:20,802 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 7 treesize of output 3 [2023-11-29 03:49:35,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:49:35,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 524 treesize of output 704