./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:09:22,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:09:22,972 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 02:09:22,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:09:22,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:09:23,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:09:23,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:09:23,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:09:23,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:09:23,022 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:09:23,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:09:23,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:09:23,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:09:23,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:09:23,024 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:09:23,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:09:23,024 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:09:23,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:09:23,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:09:23,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:09:23,024 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 02:09:23,024 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 02:09:23,024 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 02:09:23,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:09:23,025 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:09:23,025 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 02:09:23,025 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:09:23,025 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:09:23,025 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:09:23,025 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:09:23,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:09:23,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:09:23,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:09:23,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:09:23,026 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:09:23,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:09:23,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:09:23,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:09:23,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:09:23,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:09:23,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:09:23,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:09:23,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:09:23,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:09:23,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:09:23,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:09:23,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:09:23,028 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2024-11-28 02:09:23,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:09:23,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:09:23,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:09:23,414 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:09:23,416 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:09:23,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i [2024-11-28 02:09:26,671 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/data/b0aa6cc76/4769838a541b4db794c9708d395ed569/FLAG2be033268 [2024-11-28 02:09:27,226 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:09:27,230 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i [2024-11-28 02:09:27,254 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/data/b0aa6cc76/4769838a541b4db794c9708d395ed569/FLAG2be033268 [2024-11-28 02:09:27,271 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/data/b0aa6cc76/4769838a541b4db794c9708d395ed569 [2024-11-28 02:09:27,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:09:27,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:09:27,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:09:27,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:09:27,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:09:27,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:09:27" (1/1) ... [2024-11-28 02:09:27,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@479e9755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:27, skipping insertion in model container [2024-11-28 02:09:27,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:09:27" (1/1) ... [2024-11-28 02:09:27,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:09:27,956 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:09:28,020 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:09:28,028 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:09:28,033 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:09:28,042 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:09:28,057 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 02:09:28,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:09:28,076 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:09:28,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:09:28,312 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:09:28,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:28 WrapperNode [2024-11-28 02:09:28,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:09:28,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:09:28,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:09:28,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:09:28,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:28" (1/1) ... [2024-11-28 02:09:28,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:28" (1/1) ... [2024-11-28 02:09:28,449 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 787 [2024-11-28 02:09:28,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:09:28,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:09:28,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:09:28,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:09:28,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:28" (1/1) ... [2024-11-28 02:09:28,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:28" (1/1) ... [2024-11-28 02:09:28,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:28" (1/1) ... [2024-11-28 02:09:28,535 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-28 02:09:28,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:28" (1/1) ... [2024-11-28 02:09:28,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:28" (1/1) ... [2024-11-28 02:09:28,587 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:28" (1/1) ... [2024-11-28 02:09:28,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:28" (1/1) ... [2024-11-28 02:09:28,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:28" (1/1) ... [2024-11-28 02:09:28,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:28" (1/1) ... [2024-11-28 02:09:28,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:28" (1/1) ... [2024-11-28 02:09:28,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:09:28,636 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:09:28,636 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:09:28,636 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:09:28,638 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:28" (1/1) ... [2024-11-28 02:09:28,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:09:28,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:09:28,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:09:28,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:09:28,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 02:09:28,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 02:09:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 02:09:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 02:09:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 02:09:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 02:09:28,723 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 02:09:28,723 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 02:09:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 02:09:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:09:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 02:09:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 02:09:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 02:09:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 02:09:28,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 02:09:28,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:09:28,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 02:09:28,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:09:28,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:09:28,929 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:09:28,931 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:09:28,934 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:09:28,982 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:09:31,413 INFO L? ?]: Removed 762 outVars from TransFormulas that were not future-live. [2024-11-28 02:09:31,413 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:09:31,441 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:09:31,441 INFO L312 CfgBuilder]: Removed 18 assume(true) statements. [2024-11-28 02:09:31,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:09:31 BoogieIcfgContainer [2024-11-28 02:09:31,442 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:09:31,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:09:31,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:09:31,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:09:31,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:09:27" (1/3) ... [2024-11-28 02:09:31,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b25c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:09:31, skipping insertion in model container [2024-11-28 02:09:31,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:28" (2/3) ... [2024-11-28 02:09:31,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b25c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:09:31, skipping insertion in model container [2024-11-28 02:09:31,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:09:31" (3/3) ... [2024-11-28 02:09:31,457 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test1-1.i [2024-11-28 02:09:31,475 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:09:31,477 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_nondet_test1-1.i that has 3 procedures, 743 locations, 1 initial locations, 20 loop locations, and 320 error locations. [2024-11-28 02:09:31,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:09:31,553 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@195769c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:09:31,553 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-28 02:09:31,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 738 states, 416 states have (on average 2.0600961538461537) internal successors, (857), 733 states have internal predecessors, (857), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:09:31,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:09:31,566 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:31,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:09:31,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:09:31,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:31,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103276, now seen corresponding path program 1 times [2024-11-28 02:09:31,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:31,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591357298] [2024-11-28 02:09:31,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:31,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:31,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:31,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591357298] [2024-11-28 02:09:31,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591357298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:31,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:31,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:09:31,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340402] [2024-11-28 02:09:31,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:31,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 02:09:31,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:31,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 02:09:31,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:09:31,773 INFO L87 Difference]: Start difference. First operand has 738 states, 416 states have (on average 2.0600961538461537) internal successors, (857), 733 states have internal predecessors, (857), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:31,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:31,841 INFO L93 Difference]: Finished difference Result 728 states and 816 transitions. [2024-11-28 02:09:31,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 02:09:31,843 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 02:09:31,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:31,870 INFO L225 Difference]: With dead ends: 728 [2024-11-28 02:09:31,870 INFO L226 Difference]: Without dead ends: 726 [2024-11-28 02:09:31,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:09:31,880 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:31,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:09:31,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-11-28 02:09:31,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2024-11-28 02:09:31,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 410 states have (on average 1.9707317073170731) internal successors, (808), 721 states have internal predecessors, (808), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:09:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 814 transitions. [2024-11-28 02:09:31,988 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 814 transitions. Word has length 6 [2024-11-28 02:09:31,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:31,988 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 814 transitions. [2024-11-28 02:09:31,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 814 transitions. [2024-11-28 02:09:31,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:09:31,989 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:31,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:09:31,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:09:31,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:09:31,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:31,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103338, now seen corresponding path program 1 times [2024-11-28 02:09:31,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:31,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574519160] [2024-11-28 02:09:31,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:31,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:32,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:32,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574519160] [2024-11-28 02:09:32,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574519160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:32,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:32,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:09:32,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321098786] [2024-11-28 02:09:32,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:32,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:09:32,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:32,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:09:32,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:32,161 INFO L87 Difference]: Start difference. First operand 726 states and 814 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:33,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:33,071 INFO L93 Difference]: Finished difference Result 680 states and 769 transitions. [2024-11-28 02:09:33,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:09:33,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 02:09:33,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:33,076 INFO L225 Difference]: With dead ends: 680 [2024-11-28 02:09:33,077 INFO L226 Difference]: Without dead ends: 680 [2024-11-28 02:09:33,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:33,078 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 679 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:33,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 469 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 02:09:33,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-11-28 02:09:33,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 677. [2024-11-28 02:09:33,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 410 states have (on average 1.851219512195122) internal successors, (759), 672 states have internal predecessors, (759), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:09:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 765 transitions. [2024-11-28 02:09:33,106 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 765 transitions. Word has length 6 [2024-11-28 02:09:33,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:33,106 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 765 transitions. [2024-11-28 02:09:33,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:33,107 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 765 transitions. [2024-11-28 02:09:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:09:33,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:33,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:09:33,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:09:33,108 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:09:33,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:33,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103339, now seen corresponding path program 1 times [2024-11-28 02:09:33,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:33,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95805602] [2024-11-28 02:09:33,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:33,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:33,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:33,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95805602] [2024-11-28 02:09:33,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95805602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:33,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:33,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:09:33,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866363981] [2024-11-28 02:09:33,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:33,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:09:33,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:33,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:09:33,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:33,265 INFO L87 Difference]: Start difference. First operand 677 states and 765 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:34,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:34,082 INFO L93 Difference]: Finished difference Result 755 states and 849 transitions. [2024-11-28 02:09:34,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:09:34,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 02:09:34,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:34,087 INFO L225 Difference]: With dead ends: 755 [2024-11-28 02:09:34,087 INFO L226 Difference]: Without dead ends: 755 [2024-11-28 02:09:34,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:34,090 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 417 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:34,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 831 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 02:09:34,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-11-28 02:09:34,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 706. [2024-11-28 02:09:34,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 450 states have (on average 1.8377777777777777) internal successors, (827), 701 states have internal predecessors, (827), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:09:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 833 transitions. [2024-11-28 02:09:34,128 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 833 transitions. Word has length 6 [2024-11-28 02:09:34,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:34,129 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 833 transitions. [2024-11-28 02:09:34,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 833 transitions. [2024-11-28 02:09:34,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:09:34,130 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:34,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:09:34,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:09:34,131 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:09:34,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:34,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1423421085, now seen corresponding path program 1 times [2024-11-28 02:09:34,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:34,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647554696] [2024-11-28 02:09:34,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:34,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:34,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:34,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647554696] [2024-11-28 02:09:34,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647554696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:34,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:34,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:09:34,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573064610] [2024-11-28 02:09:34,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:34,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:09:34,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:34,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:09:34,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:34,183 INFO L87 Difference]: Start difference. First operand 706 states and 833 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:34,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:34,249 INFO L93 Difference]: Finished difference Result 1388 states and 1641 transitions. [2024-11-28 02:09:34,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:09:34,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 02:09:34,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:34,260 INFO L225 Difference]: With dead ends: 1388 [2024-11-28 02:09:34,260 INFO L226 Difference]: Without dead ends: 1388 [2024-11-28 02:09:34,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:34,263 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 722 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:34,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1500 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:09:34,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-28 02:09:34,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 707. [2024-11-28 02:09:34,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 451 states have (on average 1.835920177383592) internal successors, (828), 702 states have internal predecessors, (828), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:09:34,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 834 transitions. [2024-11-28 02:09:34,321 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 834 transitions. Word has length 6 [2024-11-28 02:09:34,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:34,322 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 834 transitions. [2024-11-28 02:09:34,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:34,322 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 834 transitions. [2024-11-28 02:09:34,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 02:09:34,323 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:34,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:34,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:09:34,323 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:09:34,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:34,324 INFO L85 PathProgramCache]: Analyzing trace with hash 247711511, now seen corresponding path program 1 times [2024-11-28 02:09:34,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:34,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542142304] [2024-11-28 02:09:34,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:34,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:34,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:34,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542142304] [2024-11-28 02:09:34,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542142304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:34,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:34,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:09:34,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112119755] [2024-11-28 02:09:34,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:34,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:09:34,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:34,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:09:34,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:09:34,523 INFO L87 Difference]: Start difference. First operand 707 states and 834 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:35,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:35,404 INFO L93 Difference]: Finished difference Result 734 states and 888 transitions. [2024-11-28 02:09:35,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:09:35,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-28 02:09:35,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:35,409 INFO L225 Difference]: With dead ends: 734 [2024-11-28 02:09:35,409 INFO L226 Difference]: Without dead ends: 734 [2024-11-28 02:09:35,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:09:35,410 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 943 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:35,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 735 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 02:09:35,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-11-28 02:09:35,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 684. [2024-11-28 02:09:35,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 451 states have (on average 1.7849223946784922) internal successors, (805), 679 states have internal predecessors, (805), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:09:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 811 transitions. [2024-11-28 02:09:35,442 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 811 transitions. Word has length 16 [2024-11-28 02:09:35,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:35,442 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 811 transitions. [2024-11-28 02:09:35,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 811 transitions. [2024-11-28 02:09:35,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 02:09:35,444 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:35,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:35,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:09:35,447 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:09:35,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:35,448 INFO L85 PathProgramCache]: Analyzing trace with hash 247711512, now seen corresponding path program 1 times [2024-11-28 02:09:35,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:35,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351111682] [2024-11-28 02:09:35,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:35,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:35,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:35,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351111682] [2024-11-28 02:09:35,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351111682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:35,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:35,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:09:35,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940604373] [2024-11-28 02:09:35,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:35,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:09:35,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:35,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:09:35,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:35,555 INFO L87 Difference]: Start difference. First operand 684 states and 811 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:35,599 INFO L93 Difference]: Finished difference Result 609 states and 708 transitions. [2024-11-28 02:09:35,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:09:35,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-28 02:09:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:35,603 INFO L225 Difference]: With dead ends: 609 [2024-11-28 02:09:35,603 INFO L226 Difference]: Without dead ends: 609 [2024-11-28 02:09:35,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:35,604 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 61 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:35,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1179 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:09:35,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-28 02:09:35,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-28 02:09:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 388 states have (on average 1.809278350515464) internal successors, (702), 604 states have internal predecessors, (702), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:09:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 708 transitions. [2024-11-28 02:09:35,623 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 708 transitions. Word has length 16 [2024-11-28 02:09:35,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:35,623 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 708 transitions. [2024-11-28 02:09:35,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:35,624 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 708 transitions. [2024-11-28 02:09:35,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 02:09:35,624 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:35,624 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:35,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:09:35,625 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:09:35,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:35,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1827838193, now seen corresponding path program 1 times [2024-11-28 02:09:35,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:35,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172143274] [2024-11-28 02:09:35,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:35,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:35,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:35,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:35,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172143274] [2024-11-28 02:09:35,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172143274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:35,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:35,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:09:35,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779991934] [2024-11-28 02:09:35,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:35,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:09:35,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:35,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:09:35,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:09:35,771 INFO L87 Difference]: Start difference. First operand 609 states and 708 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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) [2024-11-28 02:09:35,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:35,852 INFO L93 Difference]: Finished difference Result 591 states and 683 transitions. [2024-11-28 02:09:35,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:09:35,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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 [2024-11-28 02:09:35,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:35,855 INFO L225 Difference]: With dead ends: 591 [2024-11-28 02:09:35,855 INFO L226 Difference]: Without dead ends: 591 [2024-11-28 02:09:35,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:09:35,856 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 41 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:35,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1715 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:09:35,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-11-28 02:09:35,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 588. [2024-11-28 02:09:35,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 374 states have (on average 1.8021390374331552) internal successors, (674), 583 states have internal predecessors, (674), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:09:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 680 transitions. [2024-11-28 02:09:35,874 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 680 transitions. Word has length 18 [2024-11-28 02:09:35,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:35,874 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 680 transitions. [2024-11-28 02:09:35,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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) [2024-11-28 02:09:35,874 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 680 transitions. [2024-11-28 02:09:35,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 02:09:35,875 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:35,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:35,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:09:35,876 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:09:35,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:35,876 INFO L85 PathProgramCache]: Analyzing trace with hash -385577985, now seen corresponding path program 1 times [2024-11-28 02:09:35,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:35,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092741877] [2024-11-28 02:09:35,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:35,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:36,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:36,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:36,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092741877] [2024-11-28 02:09:36,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092741877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:36,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:36,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:09:36,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684796430] [2024-11-28 02:09:36,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:36,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:09:36,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:36,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:09:36,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:09:36,154 INFO L87 Difference]: Start difference. First operand 588 states and 680 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:37,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:37,002 INFO L93 Difference]: Finished difference Result 682 states and 768 transitions. [2024-11-28 02:09:37,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:09:37,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-28 02:09:37,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:37,007 INFO L225 Difference]: With dead ends: 682 [2024-11-28 02:09:37,007 INFO L226 Difference]: Without dead ends: 682 [2024-11-28 02:09:37,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:09:37,008 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 418 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:37,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1016 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 02:09:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-11-28 02:09:37,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 584. [2024-11-28 02:09:37,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 374 states have (on average 1.7914438502673797) internal successors, (670), 579 states have internal predecessors, (670), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:09:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 676 transitions. [2024-11-28 02:09:37,028 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 676 transitions. Word has length 32 [2024-11-28 02:09:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:37,028 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 676 transitions. [2024-11-28 02:09:37,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:37,030 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 676 transitions. [2024-11-28 02:09:37,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-28 02:09:37,035 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:37,035 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:37,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:09:37,036 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:09:37,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:37,036 INFO L85 PathProgramCache]: Analyzing trace with hash 945049781, now seen corresponding path program 1 times [2024-11-28 02:09:37,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:37,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122031138] [2024-11-28 02:09:37,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:37,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:37,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:37,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:37,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122031138] [2024-11-28 02:09:37,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122031138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:37,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:37,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:09:37,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414675042] [2024-11-28 02:09:37,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:37,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:09:37,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:37,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:09:37,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:09:37,287 INFO L87 Difference]: Start difference. First operand 584 states and 676 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:37,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:37,363 INFO L93 Difference]: Finished difference Result 584 states and 672 transitions. [2024-11-28 02:09:37,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:09:37,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-28 02:09:37,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:37,366 INFO L225 Difference]: With dead ends: 584 [2024-11-28 02:09:37,367 INFO L226 Difference]: Without dead ends: 584 [2024-11-28 02:09:37,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:09:37,368 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 21 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:37,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1697 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:09:37,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-11-28 02:09:37,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2024-11-28 02:09:37,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 374 states have (on average 1.7807486631016043) internal successors, (666), 579 states have internal predecessors, (666), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:09:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 672 transitions. [2024-11-28 02:09:37,401 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 672 transitions. Word has length 66 [2024-11-28 02:09:37,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:37,402 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 672 transitions. [2024-11-28 02:09:37,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:37,403 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 672 transitions. [2024-11-28 02:09:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 02:09:37,406 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:37,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:37,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 02:09:37,407 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:09:37,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:37,409 INFO L85 PathProgramCache]: Analyzing trace with hash -729166719, now seen corresponding path program 1 times [2024-11-28 02:09:37,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:37,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402552858] [2024-11-28 02:09:37,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:37,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:37,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:37,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402552858] [2024-11-28 02:09:37,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402552858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:37,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:37,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:09:37,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215541708] [2024-11-28 02:09:37,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:37,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:09:37,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:37,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:09:37,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:37,659 INFO L87 Difference]: Start difference. First operand 584 states and 672 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:37,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:37,717 INFO L93 Difference]: Finished difference Result 681 states and 796 transitions. [2024-11-28 02:09:37,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:09:37,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-11-28 02:09:37,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:37,720 INFO L225 Difference]: With dead ends: 681 [2024-11-28 02:09:37,720 INFO L226 Difference]: Without dead ends: 681 [2024-11-28 02:09:37,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:37,723 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 54 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:37,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1154 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:09:37,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-11-28 02:09:37,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2024-11-28 02:09:37,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 471 states have (on average 1.6772823779193207) internal successors, (790), 676 states have internal predecessors, (790), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:09:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 796 transitions. [2024-11-28 02:09:37,745 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 796 transitions. Word has length 74 [2024-11-28 02:09:37,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:37,746 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 796 transitions. [2024-11-28 02:09:37,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:37,747 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 796 transitions. [2024-11-28 02:09:37,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-28 02:09:37,748 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:37,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:37,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:09:37,751 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:09:37,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:37,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1229812623, now seen corresponding path program 1 times [2024-11-28 02:09:37,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:37,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599258132] [2024-11-28 02:09:37,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:37,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:38,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:38,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:38,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599258132] [2024-11-28 02:09:38,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599258132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:38,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:38,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:09:38,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967295612] [2024-11-28 02:09:38,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:38,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:09:38,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:38,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:09:38,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:09:38,575 INFO L87 Difference]: Start difference. First operand 681 states and 796 transitions. Second operand has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:39,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:39,545 INFO L93 Difference]: Finished difference Result 643 states and 758 transitions. [2024-11-28 02:09:39,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:09:39,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-28 02:09:39,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:39,551 INFO L225 Difference]: With dead ends: 643 [2024-11-28 02:09:39,551 INFO L226 Difference]: Without dead ends: 643 [2024-11-28 02:09:39,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:09:39,553 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 938 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:39,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 473 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 02:09:39,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-11-28 02:09:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 603. [2024-11-28 02:09:39,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 431 states have (on average 1.5614849187935034) internal successors, (673), 598 states have internal predecessors, (673), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:09:39,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 679 transitions. [2024-11-28 02:09:39,572 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 679 transitions. Word has length 77 [2024-11-28 02:09:39,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:39,573 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 679 transitions. [2024-11-28 02:09:39,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:39,574 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 679 transitions. [2024-11-28 02:09:39,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-28 02:09:39,576 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:39,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:39,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:09:39,577 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:09:39,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:39,579 INFO L85 PathProgramCache]: Analyzing trace with hash -795601644, now seen corresponding path program 1 times [2024-11-28 02:09:39,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:39,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097497594] [2024-11-28 02:09:39,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:39,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:40,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:40,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097497594] [2024-11-28 02:09:40,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097497594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:40,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:40,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:09:40,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211013784] [2024-11-28 02:09:40,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:40,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:09:40,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:40,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:09:40,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:09:40,045 INFO L87 Difference]: Start difference. First operand 603 states and 679 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:40,801 INFO L93 Difference]: Finished difference Result 602 states and 678 transitions. [2024-11-28 02:09:40,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:09:40,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-28 02:09:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:40,804 INFO L225 Difference]: With dead ends: 602 [2024-11-28 02:09:40,805 INFO L226 Difference]: Without dead ends: 602 [2024-11-28 02:09:40,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:09:40,805 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 2 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:40,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1510 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 02:09:40,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-28 02:09:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2024-11-28 02:09:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 431 states have (on average 1.5591647331786542) internal successors, (672), 597 states have internal predecessors, (672), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:09:40,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 678 transitions. [2024-11-28 02:09:40,823 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 678 transitions. Word has length 82 [2024-11-28 02:09:40,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:40,824 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 678 transitions. [2024-11-28 02:09:40,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 678 transitions. [2024-11-28 02:09:40,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-28 02:09:40,826 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:40,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:40,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 02:09:40,826 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:09:40,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:40,827 INFO L85 PathProgramCache]: Analyzing trace with hash -795601643, now seen corresponding path program 1 times [2024-11-28 02:09:40,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:40,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118967773] [2024-11-28 02:09:40,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:40,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:41,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:41,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:41,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118967773] [2024-11-28 02:09:41,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118967773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:41,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:41,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:09:41,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301671329] [2024-11-28 02:09:41,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:41,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:09:41,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:41,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:09:41,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:09:41,505 INFO L87 Difference]: Start difference. First operand 602 states and 678 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:42,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:42,387 INFO L93 Difference]: Finished difference Result 601 states and 677 transitions. [2024-11-28 02:09:42,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:09:42,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-28 02:09:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:42,390 INFO L225 Difference]: With dead ends: 601 [2024-11-28 02:09:42,391 INFO L226 Difference]: Without dead ends: 601 [2024-11-28 02:09:42,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:09:42,394 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 1 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:42,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1519 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 02:09:42,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-28 02:09:42,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2024-11-28 02:09:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 430 states have (on average 1.5604651162790697) internal successors, (671), 596 states have internal predecessors, (671), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:09:42,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 677 transitions. [2024-11-28 02:09:42,413 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 677 transitions. Word has length 82 [2024-11-28 02:09:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:42,414 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 677 transitions. [2024-11-28 02:09:42,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 677 transitions. [2024-11-28 02:09:42,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 02:09:42,417 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:42,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:42,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:09:42,417 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:09:42,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:42,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1932962117, now seen corresponding path program 1 times [2024-11-28 02:09:42,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:42,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066408034] [2024-11-28 02:09:42,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:42,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:42,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:42,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066408034] [2024-11-28 02:09:42,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066408034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:42,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:42,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:09:42,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437632411] [2024-11-28 02:09:42,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:42,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:09:42,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:42,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:09:42,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:09:42,789 INFO L87 Difference]: Start difference. First operand 601 states and 677 transitions. Second operand has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:09:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:43,838 INFO L93 Difference]: Finished difference Result 613 states and 692 transitions. [2024-11-28 02:09:43,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:09:43,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-28 02:09:43,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:43,843 INFO L225 Difference]: With dead ends: 613 [2024-11-28 02:09:43,843 INFO L226 Difference]: Without dead ends: 613 [2024-11-28 02:09:43,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:09:43,844 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 6 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:43,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2363 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 02:09:43,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-28 02:09:43,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 607. [2024-11-28 02:09:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 435 states have (on average 1.5586206896551724) internal successors, (678), 601 states have internal predecessors, (678), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 02:09:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 687 transitions. [2024-11-28 02:09:43,862 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 687 transitions. Word has length 90 [2024-11-28 02:09:43,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:43,863 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 687 transitions. [2024-11-28 02:09:43,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:09:43,863 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 687 transitions. [2024-11-28 02:09:43,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 02:09:43,864 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:43,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:43,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 02:09:43,865 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:09:43,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:43,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1932962116, now seen corresponding path program 1 times [2024-11-28 02:09:43,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:43,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619768540] [2024-11-28 02:09:43,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:43,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:44,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:44,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:44,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619768540] [2024-11-28 02:09:44,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619768540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:44,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:44,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:09:44,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539091202] [2024-11-28 02:09:44,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:44,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:09:44,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:44,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:09:44,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:09:44,710 INFO L87 Difference]: Start difference. First operand 607 states and 687 transitions. Second operand has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:09:45,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:45,676 INFO L93 Difference]: Finished difference Result 607 states and 686 transitions. [2024-11-28 02:09:45,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:09:45,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-28 02:09:45,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:45,680 INFO L225 Difference]: With dead ends: 607 [2024-11-28 02:09:45,681 INFO L226 Difference]: Without dead ends: 607 [2024-11-28 02:09:45,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:09:45,684 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 1 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:45,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1955 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 02:09:45,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-28 02:09:45,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2024-11-28 02:09:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 435 states have (on average 1.5563218390804598) internal successors, (677), 601 states have internal predecessors, (677), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 02:09:45,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 686 transitions. [2024-11-28 02:09:45,704 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 686 transitions. Word has length 90 [2024-11-28 02:09:45,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:45,704 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 686 transitions. [2024-11-28 02:09:45,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:09:45,704 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 686 transitions. [2024-11-28 02:09:45,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-28 02:09:45,705 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:45,705 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:45,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 02:09:45,706 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:09:45,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:45,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1489621638, now seen corresponding path program 1 times [2024-11-28 02:09:45,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:45,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557953653] [2024-11-28 02:09:45,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:45,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:46,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:46,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:46,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557953653] [2024-11-28 02:09:46,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557953653] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:09:46,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694190829] [2024-11-28 02:09:46,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:46,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:09:46,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:09:46,499 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:09:46,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:09:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:46,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-28 02:09:46,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:09:47,017 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:09:47,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:09:47,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:09:47,141 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:47,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:09:47,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:09:47,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:47,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:09:47,267 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-28 02:09:47,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-28 02:09:47,278 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_502) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem51#1.base|)) is different from false [2024-11-28 02:09:47,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694190829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:09:47,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:09:47,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2024-11-28 02:09:47,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112009149] [2024-11-28 02:09:47,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:09:47,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 02:09:47,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:47,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 02:09:47,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-11-28 02:09:47,286 INFO L87 Difference]: Start difference. First operand 607 states and 686 transitions. Second operand has 14 states, 12 states have (on average 8.666666666666666) internal successors, (104), 13 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:09:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:49,434 INFO L93 Difference]: Finished difference Result 606 states and 685 transitions. [2024-11-28 02:09:49,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:09:49,435 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.666666666666666) internal successors, (104), 13 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2024-11-28 02:09:49,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:49,439 INFO L225 Difference]: With dead ends: 606 [2024-11-28 02:09:49,440 INFO L226 Difference]: Without dead ends: 606 [2024-11-28 02:09:49,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2024-11-28 02:09:49,442 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 502 mSDsluCounter, 2494 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 2821 SdHoareTripleChecker+Invalid, 2137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:49,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 2821 Invalid, 2137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2122 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 02:09:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-28 02:09:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-28 02:09:49,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 435 states have (on average 1.554022988505747) internal successors, (676), 600 states have internal predecessors, (676), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-28 02:09:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 685 transitions. [2024-11-28 02:09:49,465 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 685 transitions. Word has length 91 [2024-11-28 02:09:49,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:49,465 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 685 transitions. [2024-11-28 02:09:49,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.666666666666666) internal successors, (104), 13 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:09:49,466 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 685 transitions. [2024-11-28 02:09:49,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-28 02:09:49,467 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:49,467 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:49,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 02:09:49,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:09:49,672 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:09:49,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:49,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1489621639, now seen corresponding path program 1 times [2024-11-28 02:09:49,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:49,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613752817] [2024-11-28 02:09:49,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:49,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:50,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:50,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613752817] [2024-11-28 02:09:50,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613752817] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:09:50,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425359446] [2024-11-28 02:09:50,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:50,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:09:50,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:09:50,860 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:09:50,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:09:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:51,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-28 02:09:51,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:09:51,317 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:09:51,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:09:51,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 02:09:51,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 13 treesize of output 9 [2024-11-28 02:09:51,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:09:51,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 02:09:51,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:09:51,645 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:51,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:09:51,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:09:51,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:09:51,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:09:51,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:51,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:09:51,855 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_629 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:09:51,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425359446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:09:51,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:09:51,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2024-11-28 02:09:51,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777717153] [2024-11-28 02:09:51,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:09:51,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:09:51,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:51,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:09:51,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2024-11-28 02:09:51,861 INFO L87 Difference]: Start difference. First operand 606 states and 685 transitions. Second operand has 15 states, 12 states have (on average 9.166666666666666) internal successors, (110), 15 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:09:54,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:54,398 INFO L93 Difference]: Finished difference Result 613 states and 692 transitions. [2024-11-28 02:09:54,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:09:54,398 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.166666666666666) internal successors, (110), 15 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 91 [2024-11-28 02:09:54,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:54,401 INFO L225 Difference]: With dead ends: 613 [2024-11-28 02:09:54,401 INFO L226 Difference]: Without dead ends: 613 [2024-11-28 02:09:54,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2024-11-28 02:09:54,402 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 495 mSDsluCounter, 1889 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:54,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 2218 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2178 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-28 02:09:54,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-28 02:09:54,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 604. [2024-11-28 02:09:54,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 434 states have (on average 1.5529953917050692) internal successors, (674), 598 states have internal predecessors, (674), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:09:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 680 transitions. [2024-11-28 02:09:54,420 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 680 transitions. Word has length 91 [2024-11-28 02:09:54,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:54,420 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 680 transitions. [2024-11-28 02:09:54,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.166666666666666) internal successors, (110), 15 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:09:54,421 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 680 transitions. [2024-11-28 02:09:54,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-28 02:09:54,422 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:54,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:54,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 02:09:54,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-28 02:09:54,623 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:09:54,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:54,623 INFO L85 PathProgramCache]: Analyzing trace with hash 2047694902, now seen corresponding path program 1 times [2024-11-28 02:09:54,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:54,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310284732] [2024-11-28 02:09:54,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:54,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:55,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:55,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310284732] [2024-11-28 02:09:55,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310284732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:55,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:55,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 02:09:55,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755423556] [2024-11-28 02:09:55,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:55,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 02:09:55,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:55,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 02:09:55,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:09:55,360 INFO L87 Difference]: Start difference. First operand 604 states and 680 transitions. Second operand has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:09:57,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:57,069 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-11-28 02:09:57,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:09:57,070 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-28 02:09:57,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:57,072 INFO L225 Difference]: With dead ends: 617 [2024-11-28 02:09:57,072 INFO L226 Difference]: Without dead ends: 617 [2024-11-28 02:09:57,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-28 02:09:57,074 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 502 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:57,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 2507 Invalid, 1928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1914 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-28 02:09:57,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-28 02:09:57,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2024-11-28 02:09:57,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 442 states have (on average 1.5475113122171946) internal successors, (684), 606 states have internal predecessors, (684), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:09:57,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 691 transitions. [2024-11-28 02:09:57,095 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 691 transitions. Word has length 93 [2024-11-28 02:09:57,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:57,096 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 691 transitions. [2024-11-28 02:09:57,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:09:57,097 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 691 transitions. [2024-11-28 02:09:57,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-28 02:09:57,098 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:57,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:57,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 02:09:57,099 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:09:57,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:57,100 INFO L85 PathProgramCache]: Analyzing trace with hash 2047694903, now seen corresponding path program 1 times [2024-11-28 02:09:57,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:57,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557865949] [2024-11-28 02:09:57,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:57,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:58,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:58,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557865949] [2024-11-28 02:09:58,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557865949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:58,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:58,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 02:09:58,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904700352] [2024-11-28 02:09:58,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:58,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 02:09:58,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:58,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 02:09:58,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:09:58,110 INFO L87 Difference]: Start difference. First operand 613 states and 691 transitions. Second operand has 11 states, 10 states have (on average 9.1) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:10:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:00,013 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-11-28 02:10:00,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:10:00,013 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.1) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-28 02:10:00,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:00,016 INFO L225 Difference]: With dead ends: 616 [2024-11-28 02:10:00,016 INFO L226 Difference]: Without dead ends: 616 [2024-11-28 02:10:00,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:10:00,017 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 479 mSDsluCounter, 1565 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1895 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:00,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1895 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 02:10:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-28 02:10:00,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2024-11-28 02:10:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 442 states have (on average 1.5452488687782806) internal successors, (683), 606 states have internal predecessors, (683), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:10:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 690 transitions. [2024-11-28 02:10:00,038 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 690 transitions. Word has length 93 [2024-11-28 02:10:00,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:00,038 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 690 transitions. [2024-11-28 02:10:00,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.1) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:10:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 690 transitions. [2024-11-28 02:10:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-28 02:10:00,040 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:00,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:10:00,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 02:10:00,041 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:10:00,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:00,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1716733067, now seen corresponding path program 1 times [2024-11-28 02:10:00,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:00,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964444095] [2024-11-28 02:10:00,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:00,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:00,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:00,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964444095] [2024-11-28 02:10:00,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964444095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:00,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791052844] [2024-11-28 02:10:00,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:00,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:10:00,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:10:00,773 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:10:00,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:10:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:01,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-28 02:10:01,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:10:01,185 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:10:01,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:10:01,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:10:01,273 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:01,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:10:01,341 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:01,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 42 treesize of output 41 [2024-11-28 02:10:01,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:10:01,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:01,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:10:01,379 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_878) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-28 02:10:01,482 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-28 02:10:01,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-28 02:10:01,491 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_881 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_881))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_878)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-28 02:10:01,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791052844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:01,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:10:01,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2024-11-28 02:10:01,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006000943] [2024-11-28 02:10:01,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:10:01,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:10:01,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:10:01,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:10:01,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=225, Unknown=6, NotChecked=62, Total=342 [2024-11-28 02:10:01,498 INFO L87 Difference]: Start difference. First operand 613 states and 690 transitions. Second operand has 16 states, 14 states have (on average 7.785714285714286) internal successors, (109), 15 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:10:03,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:03,455 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2024-11-28 02:10:03,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:10:03,456 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.785714285714286) internal successors, (109), 15 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-28 02:10:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:03,458 INFO L225 Difference]: With dead ends: 615 [2024-11-28 02:10:03,458 INFO L226 Difference]: Without dead ends: 615 [2024-11-28 02:10:03,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=451, Unknown=6, NotChecked=90, Total=650 [2024-11-28 02:10:03,460 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 496 mSDsluCounter, 3065 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 3391 SdHoareTripleChecker+Invalid, 2604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:03,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 3391 Invalid, 2604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 02:10:03,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-28 02:10:03,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 612. [2024-11-28 02:10:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 442 states have (on average 1.5429864253393666) internal successors, (682), 605 states have internal predecessors, (682), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:10:03,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 689 transitions. [2024-11-28 02:10:03,474 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 689 transitions. Word has length 94 [2024-11-28 02:10:03,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:03,474 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 689 transitions. [2024-11-28 02:10:03,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.785714285714286) internal successors, (109), 15 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:10:03,475 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 689 transitions. [2024-11-28 02:10:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-28 02:10:03,476 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:03,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:10:03,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 02:10:03,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:10:03,680 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:10:03,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:03,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1716733068, now seen corresponding path program 1 times [2024-11-28 02:10:03,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:03,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477806808] [2024-11-28 02:10:03,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:03,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:04,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:04,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477806808] [2024-11-28 02:10:04,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477806808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:04,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652725270] [2024-11-28 02:10:04,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:04,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:10:04,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:10:04,763 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:10:04,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:10:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:05,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-28 02:10:05,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:10:05,170 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:10:05,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:10:05,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:10:05,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:10:05,473 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:05,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:10:05,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:10:05,608 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:05,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:10:05,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:10:05,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:10:05,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:10:05,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:05,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:10:05,782 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1016 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1015 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1015) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 02:10:05,798 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1015 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1016) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1015) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1016 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1016) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2024-11-28 02:10:05,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:10:05,927 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 84 treesize of output 88 [2024-11-28 02:10:06,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652725270] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:06,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:10:06,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2024-11-28 02:10:06,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346304052] [2024-11-28 02:10:06,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:10:06,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 02:10:06,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:10:06,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 02:10:06,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=478, Unknown=2, NotChecked=90, Total=650 [2024-11-28 02:10:06,087 INFO L87 Difference]: Start difference. First operand 612 states and 689 transitions. Second operand has 21 states, 18 states have (on average 6.777777777777778) internal successors, (122), 21 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:10:08,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:08,930 INFO L93 Difference]: Finished difference Result 614 states and 693 transitions. [2024-11-28 02:10:08,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:10:08,931 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 6.777777777777778) internal successors, (122), 21 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2024-11-28 02:10:08,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:08,933 INFO L225 Difference]: With dead ends: 614 [2024-11-28 02:10:08,933 INFO L226 Difference]: Without dead ends: 614 [2024-11-28 02:10:08,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=690, Unknown=2, NotChecked=110, Total=930 [2024-11-28 02:10:08,934 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 474 mSDsluCounter, 3248 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 3572 SdHoareTripleChecker+Invalid, 3547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:08,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 3572 Invalid, 3547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3528 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-28 02:10:08,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-28 02:10:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 602. [2024-11-28 02:10:08,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 434 states have (on average 1.5483870967741935) internal successors, (672), 596 states have internal predecessors, (672), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:10:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 678 transitions. [2024-11-28 02:10:08,947 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 678 transitions. Word has length 94 [2024-11-28 02:10:08,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:08,948 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 678 transitions. [2024-11-28 02:10:08,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 6.777777777777778) internal successors, (122), 21 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:10:08,948 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 678 transitions. [2024-11-28 02:10:08,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 02:10:08,949 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:08,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:10:08,961 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 02:10:09,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:10:09,150 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:10:09,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:09,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1458945026, now seen corresponding path program 1 times [2024-11-28 02:10:09,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:09,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270808] [2024-11-28 02:10:09,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:09,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:09,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:09,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270808] [2024-11-28 02:10:09,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:10:09,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:10:09,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 02:10:09,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556362310] [2024-11-28 02:10:09,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:10:09,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:10:09,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:10:09,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:10:09,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:10:09,903 INFO L87 Difference]: Start difference. First operand 602 states and 678 transitions. Second operand has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:10:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:11,419 INFO L93 Difference]: Finished difference Result 618 states and 697 transitions. [2024-11-28 02:10:11,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:10:11,420 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-28 02:10:11,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:11,423 INFO L225 Difference]: With dead ends: 618 [2024-11-28 02:10:11,423 INFO L226 Difference]: Without dead ends: 618 [2024-11-28 02:10:11,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-28 02:10:11,425 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 503 mSDsluCounter, 2177 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 2502 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:11,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 2502 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1915 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 02:10:11,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-28 02:10:11,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 614. [2024-11-28 02:10:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 445 states have (on average 1.5393258426966292) internal successors, (685), 607 states have internal predecessors, (685), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:10:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 692 transitions. [2024-11-28 02:10:11,439 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 692 transitions. Word has length 96 [2024-11-28 02:10:11,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:11,439 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 692 transitions. [2024-11-28 02:10:11,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:10:11,440 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 692 transitions. [2024-11-28 02:10:11,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 02:10:11,441 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:11,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:10:11,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 02:10:11,441 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:10:11,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:11,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1458945027, now seen corresponding path program 1 times [2024-11-28 02:10:11,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:11,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423678489] [2024-11-28 02:10:11,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:11,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:12,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:12,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:12,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423678489] [2024-11-28 02:10:12,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423678489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:10:12,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:10:12,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 02:10:12,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298853467] [2024-11-28 02:10:12,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:10:12,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 02:10:12,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:10:12,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 02:10:12,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-28 02:10:12,375 INFO L87 Difference]: Start difference. First operand 614 states and 692 transitions. Second operand has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:10:13,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:13,995 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-11-28 02:10:13,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:10:13,996 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-28 02:10:13,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:13,998 INFO L225 Difference]: With dead ends: 617 [2024-11-28 02:10:13,998 INFO L226 Difference]: Without dead ends: 617 [2024-11-28 02:10:13,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:10:13,998 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 497 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:13,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 2129 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-28 02:10:13,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-28 02:10:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 614. [2024-11-28 02:10:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 445 states have (on average 1.5370786516853931) internal successors, (684), 607 states have internal predecessors, (684), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:10:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 691 transitions. [2024-11-28 02:10:14,009 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 691 transitions. Word has length 96 [2024-11-28 02:10:14,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:14,009 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 691 transitions. [2024-11-28 02:10:14,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:10:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 691 transitions. [2024-11-28 02:10:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-28 02:10:14,010 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:14,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:10:14,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 02:10:14,011 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:10:14,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:14,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1275137139, now seen corresponding path program 1 times [2024-11-28 02:10:14,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:14,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860515228] [2024-11-28 02:10:14,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:14,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:14,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:14,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860515228] [2024-11-28 02:10:14,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860515228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:14,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035333839] [2024-11-28 02:10:14,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:14,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:10:14,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:10:14,802 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:10:14,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:10:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:15,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 02:10:15,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:10:15,206 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:10:15,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:10:15,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:10:15,315 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:15,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:10:15,374 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:15,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:10:15,444 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:15,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:10:15,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:10:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:15,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:10:15,589 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1294))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1295)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:10:15,602 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1294))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1295)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:10:15,654 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-28 02:10:15,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2024-11-28 02:10:15,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035333839] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:15,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:10:15,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 17 [2024-11-28 02:10:15,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913420119] [2024-11-28 02:10:15,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:10:15,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:10:15,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:10:15,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:10:15,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=337, Unknown=22, NotChecked=78, Total=506 [2024-11-28 02:10:15,718 INFO L87 Difference]: Start difference. First operand 614 states and 691 transitions. Second operand has 18 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:10:17,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:17,578 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-11-28 02:10:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:10:17,579 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2024-11-28 02:10:17,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:17,581 INFO L225 Difference]: With dead ends: 616 [2024-11-28 02:10:17,581 INFO L226 Difference]: Without dead ends: 616 [2024-11-28 02:10:17,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=661, Unknown=22, NotChecked=110, Total=930 [2024-11-28 02:10:17,582 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 474 mSDsluCounter, 3069 mSDsCounter, 0 mSdLazyCounter, 2594 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 3394 SdHoareTripleChecker+Invalid, 2608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:17,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 3394 Invalid, 2608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2594 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 02:10:17,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-28 02:10:17,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2024-11-28 02:10:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 445 states have (on average 1.5348314606741573) internal successors, (683), 606 states have internal predecessors, (683), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:10:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 690 transitions. [2024-11-28 02:10:17,593 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 690 transitions. Word has length 97 [2024-11-28 02:10:17,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:17,593 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 690 transitions. [2024-11-28 02:10:17,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:10:17,593 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 690 transitions. [2024-11-28 02:10:17,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-28 02:10:17,595 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:17,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:10:17,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 02:10:17,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:10:17,795 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:10:17,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:17,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1275137138, now seen corresponding path program 1 times [2024-11-28 02:10:17,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:17,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917162690] [2024-11-28 02:10:17,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:17,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:18,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:18,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:18,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917162690] [2024-11-28 02:10:18,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917162690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:18,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668563732] [2024-11-28 02:10:18,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:18,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:10:18,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:10:18,772 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:10:18,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 02:10:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:19,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-28 02:10:19,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:10:19,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 02:10:19,187 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:10:19,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:10:19,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:10:19,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:10:19,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 02:10:19,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:10:19,481 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:19,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:10:19,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:10:19,579 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:19,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:10:19,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:10:19,660 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:19,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:10:19,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:10:19,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:10:19,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:10:19,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:19,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:10:19,800 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1447 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1448 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))))) is different from false [2024-11-28 02:10:19,814 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1447 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1448 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2024-11-28 02:10:19,839 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1445))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1446) .cse0 v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1446) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-28 02:10:19,857 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1446) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1445))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1446) .cse2 v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-28 02:10:19,922 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1454))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1453) .cse0 v_ArrVal_1446) (select (select (store .cse1 .cse0 v_ArrVal_1445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1448))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1454))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1445))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1453) .cse3 v_ArrVal_1446) .cse4 v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-28 02:10:19,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668563732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:19,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:10:19,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2024-11-28 02:10:19,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804335254] [2024-11-28 02:10:19,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:10:19,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 02:10:19,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:10:19,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 02:10:19,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=479, Unknown=5, NotChecked=240, Total=812 [2024-11-28 02:10:19,926 INFO L87 Difference]: Start difference. First operand 613 states and 690 transitions. Second operand has 22 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 22 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:10:21,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:21,952 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2024-11-28 02:10:21,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:10:21,953 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 22 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2024-11-28 02:10:21,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:21,954 INFO L225 Difference]: With dead ends: 615 [2024-11-28 02:10:21,954 INFO L226 Difference]: Without dead ends: 615 [2024-11-28 02:10:21,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=744, Unknown=5, NotChecked=300, Total=1190 [2024-11-28 02:10:21,955 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 493 mSDsluCounter, 2601 mSDsCounter, 0 mSdLazyCounter, 3116 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 2928 SdHoareTripleChecker+Invalid, 3135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:21,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 2928 Invalid, 3135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3116 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 02:10:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-28 02:10:21,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 600. [2024-11-28 02:10:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 434 states have (on average 1.543778801843318) internal successors, (670), 594 states have internal predecessors, (670), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:10:21,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 676 transitions. [2024-11-28 02:10:21,964 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 676 transitions. Word has length 97 [2024-11-28 02:10:21,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:21,965 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 676 transitions. [2024-11-28 02:10:21,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 22 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:10:21,965 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 676 transitions. [2024-11-28 02:10:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 02:10:21,966 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:21,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:10:21,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 02:10:22,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-28 02:10:22,167 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:10:22,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:22,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1637134370, now seen corresponding path program 1 times [2024-11-28 02:10:22,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:22,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321639665] [2024-11-28 02:10:22,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:22,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:23,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:23,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321639665] [2024-11-28 02:10:23,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321639665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:10:23,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:10:23,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 02:10:23,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699725162] [2024-11-28 02:10:23,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:10:23,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 02:10:23,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:10:23,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 02:10:23,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-28 02:10:23,215 INFO L87 Difference]: Start difference. First operand 600 states and 676 transitions. Second operand has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:10:25,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:25,163 INFO L93 Difference]: Finished difference Result 619 states and 698 transitions. [2024-11-28 02:10:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 02:10:25,163 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-28 02:10:25,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:25,165 INFO L225 Difference]: With dead ends: 619 [2024-11-28 02:10:25,165 INFO L226 Difference]: Without dead ends: 619 [2024-11-28 02:10:25,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:10:25,165 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 482 mSDsluCounter, 2315 mSDsCounter, 0 mSdLazyCounter, 2806 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 2643 SdHoareTripleChecker+Invalid, 2818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:25,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 2643 Invalid, 2818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2806 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 02:10:25,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-28 02:10:25,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 615. [2024-11-28 02:10:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 448 states have (on average 1.53125) internal successors, (686), 608 states have internal predecessors, (686), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:10:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 693 transitions. [2024-11-28 02:10:25,174 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 693 transitions. Word has length 99 [2024-11-28 02:10:25,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:25,175 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 693 transitions. [2024-11-28 02:10:25,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:10:25,175 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 693 transitions. [2024-11-28 02:10:25,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 02:10:25,176 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:25,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:10:25,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 02:10:25,176 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:10:25,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:25,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1637134371, now seen corresponding path program 1 times [2024-11-28 02:10:25,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:25,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603608592] [2024-11-28 02:10:25,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:25,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:25,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:25,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603608592] [2024-11-28 02:10:25,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603608592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:10:25,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:10:25,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 02:10:25,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196450814] [2024-11-28 02:10:25,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:10:25,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:10:25,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:10:25,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:10:25,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:10:25,755 INFO L87 Difference]: Start difference. First operand 615 states and 693 transitions. Second operand has 16 states, 14 states have (on average 6.928571428571429) internal successors, (97), 15 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:10:27,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:27,218 INFO L93 Difference]: Finished difference Result 618 states and 697 transitions. [2024-11-28 02:10:27,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:10:27,219 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.928571428571429) internal successors, (97), 15 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-28 02:10:27,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:27,221 INFO L225 Difference]: With dead ends: 618 [2024-11-28 02:10:27,221 INFO L226 Difference]: Without dead ends: 618 [2024-11-28 02:10:27,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-11-28 02:10:27,222 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 484 mSDsluCounter, 2790 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 3115 SdHoareTripleChecker+Invalid, 2384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:27,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 3115 Invalid, 2384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2370 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 02:10:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-28 02:10:27,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 615. [2024-11-28 02:10:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 448 states have (on average 1.5290178571428572) internal successors, (685), 608 states have internal predecessors, (685), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:10:27,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 692 transitions. [2024-11-28 02:10:27,231 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 692 transitions. Word has length 99 [2024-11-28 02:10:27,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:27,232 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 692 transitions. [2024-11-28 02:10:27,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.928571428571429) internal successors, (97), 15 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:10:27,232 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 692 transitions. [2024-11-28 02:10:27,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 02:10:27,233 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:27,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:10:27,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 02:10:27,234 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:10:27,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:27,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1375856755, now seen corresponding path program 1 times [2024-11-28 02:10:27,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:27,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645833284] [2024-11-28 02:10:27,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:27,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:28,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:28,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645833284] [2024-11-28 02:10:28,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645833284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:28,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851429795] [2024-11-28 02:10:28,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:28,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:10:28,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:10:28,455 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:10:28,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 02:10:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:28,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-28 02:10:28,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:10:28,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 02:10:28,865 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:10:28,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:10:28,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:10:28,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:10:28,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 02:10:28,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:10:29,081 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:29,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:10:29,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:10:29,178 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:29,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:10:29,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:10:29,267 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:29,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:10:29,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:10:29,358 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:29,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:10:29,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:10:29,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:10:29,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:10:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:29,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:10:29,473 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1757 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2024-11-28 02:10:29,485 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1757 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-28 02:10:29,508 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1756))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1755) .cse0 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1755) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1756) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-28 02:10:29,613 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1753))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1756))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1754) .cse0 v_ArrVal_1755) .cse1 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1753))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1754) .cse5 v_ArrVal_1755) (select (select (store .cse6 .cse5 v_ArrVal_1756) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1757))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-11-28 02:10:29,645 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1753))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1756))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1754) .cse1 v_ArrVal_1755) .cse2 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1753))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1754) .cse6 v_ArrVal_1755) (select (select (store .cse7 .cse6 v_ArrVal_1756) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1757))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2024-11-28 02:10:29,786 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1764))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1753))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1763) .cse0 v_ArrVal_1754) .cse1 v_ArrVal_1755) (select (select (store .cse2 .cse1 v_ArrVal_1756) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1757))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1764))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1753))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1756))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1763) .cse5 v_ArrVal_1754) .cse6 v_ArrVal_1755) .cse7 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-28 02:10:29,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851429795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:29,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:10:29,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 19 [2024-11-28 02:10:29,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727062293] [2024-11-28 02:10:29,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:10:29,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 02:10:29,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:10:29,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 02:10:29,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=421, Unknown=13, NotChecked=282, Total=812 [2024-11-28 02:10:29,790 INFO L87 Difference]: Start difference. First operand 615 states and 692 transitions. Second operand has 20 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:10:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:31,888 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-11-28 02:10:31,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:10:31,889 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-11-28 02:10:31,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:31,890 INFO L225 Difference]: With dead ends: 617 [2024-11-28 02:10:31,890 INFO L226 Difference]: Without dead ends: 617 [2024-11-28 02:10:31,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=725, Unknown=13, NotChecked=366, Total=1260 [2024-11-28 02:10:31,891 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 472 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:31,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 2450 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 02:10:31,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-28 02:10:31,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 614. [2024-11-28 02:10:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 448 states have (on average 1.5267857142857142) internal successors, (684), 607 states have internal predecessors, (684), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:10:31,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 691 transitions. [2024-11-28 02:10:31,901 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 691 transitions. Word has length 100 [2024-11-28 02:10:31,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:31,901 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 691 transitions. [2024-11-28 02:10:31,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:10:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 691 transitions. [2024-11-28 02:10:31,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 02:10:31,903 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:31,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:10:31,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 02:10:32,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-28 02:10:32,107 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:10:32,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:32,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1375856754, now seen corresponding path program 1 times [2024-11-28 02:10:32,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:32,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786822822] [2024-11-28 02:10:32,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:32,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:32,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:32,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:32,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786822822] [2024-11-28 02:10:32,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786822822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:32,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277518088] [2024-11-28 02:10:32,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:32,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:10:32,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:10:32,938 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:10:32,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 02:10:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:33,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-28 02:10:33,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:10:33,362 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:10:33,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:10:33,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:10:33,430 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:33,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:10:33,479 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:33,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:10:33,534 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:33,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:10:33,581 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:33,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:10:33,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:10:33,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:33,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:10:33,616 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1922 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1922) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-28 02:10:33,671 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1921))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1922)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:10:33,680 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1921))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1922)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:10:33,693 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int)) (v_ArrVal_1920 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1920))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1921)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1922)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 02:10:33,795 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-28 02:10:33,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2024-11-28 02:10:33,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277518088] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:33,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:10:33,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 19 [2024-11-28 02:10:33,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358009827] [2024-11-28 02:10:33,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:10:33,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 02:10:33,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:10:33,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 02:10:33,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=407, Unknown=25, NotChecked=180, Total=702 [2024-11-28 02:10:33,883 INFO L87 Difference]: Start difference. First operand 614 states and 691 transitions. Second operand has 20 states, 18 states have (on average 6.611111111111111) internal successors, (119), 19 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:10:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:35,637 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-11-28 02:10:35,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:10:35,638 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.611111111111111) internal successors, (119), 19 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2024-11-28 02:10:35,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:35,640 INFO L225 Difference]: With dead ends: 616 [2024-11-28 02:10:35,640 INFO L226 Difference]: Without dead ends: 616 [2024-11-28 02:10:35,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=809, Unknown=25, NotChecked=252, Total=1260 [2024-11-28 02:10:35,640 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 485 mSDsluCounter, 2789 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 3113 SdHoareTripleChecker+Invalid, 2358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:35,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 3113 Invalid, 2358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-28 02:10:35,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-28 02:10:35,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 598. [2024-11-28 02:10:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 434 states have (on average 1.5391705069124424) internal successors, (668), 592 states have internal predecessors, (668), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:10:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 674 transitions. [2024-11-28 02:10:35,649 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 674 transitions. Word has length 100 [2024-11-28 02:10:35,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:35,650 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 674 transitions. [2024-11-28 02:10:35,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.611111111111111) internal successors, (119), 19 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:10:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 674 transitions. [2024-11-28 02:10:35,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 02:10:35,650 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:35,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:10:35,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 02:10:35,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-28 02:10:35,851 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:10:35,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:35,852 INFO L85 PathProgramCache]: Analyzing trace with hash -679205281, now seen corresponding path program 1 times [2024-11-28 02:10:35,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:35,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561260861] [2024-11-28 02:10:35,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:35,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:36,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:36,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561260861] [2024-11-28 02:10:36,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561260861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:10:36,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:10:36,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 02:10:36,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488301917] [2024-11-28 02:10:36,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:10:36,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 02:10:36,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:10:36,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 02:10:36,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:10:36,700 INFO L87 Difference]: Start difference. First operand 598 states and 674 transitions. Second operand has 17 states, 15 states have (on average 6.733333333333333) internal successors, (101), 16 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:10:38,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:38,139 INFO L93 Difference]: Finished difference Result 621 states and 700 transitions. [2024-11-28 02:10:38,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:10:38,140 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.733333333333333) internal successors, (101), 16 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-28 02:10:38,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:38,142 INFO L225 Difference]: With dead ends: 621 [2024-11-28 02:10:38,142 INFO L226 Difference]: Without dead ends: 621 [2024-11-28 02:10:38,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2024-11-28 02:10:38,142 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 503 mSDsluCounter, 2486 mSDsCounter, 0 mSdLazyCounter, 2153 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:38,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 2809 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2153 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 02:10:38,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-28 02:10:38,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 617. [2024-11-28 02:10:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 452 states have (on average 1.5221238938053097) internal successors, (688), 610 states have internal predecessors, (688), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:10:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 695 transitions. [2024-11-28 02:10:38,150 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 695 transitions. Word has length 103 [2024-11-28 02:10:38,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:38,150 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 695 transitions. [2024-11-28 02:10:38,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.733333333333333) internal successors, (101), 16 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:10:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 695 transitions. [2024-11-28 02:10:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 02:10:38,151 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:38,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:10:38,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 02:10:38,151 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:10:38,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:38,152 INFO L85 PathProgramCache]: Analyzing trace with hash -679205280, now seen corresponding path program 1 times [2024-11-28 02:10:38,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:38,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509563501] [2024-11-28 02:10:38,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:38,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:39,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:39,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:39,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509563501] [2024-11-28 02:10:39,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509563501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:10:39,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:10:39,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 02:10:39,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066093755] [2024-11-28 02:10:39,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:10:39,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:10:39,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:10:39,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:10:39,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-28 02:10:39,694 INFO L87 Difference]: Start difference. First operand 617 states and 695 transitions. Second operand has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:10:41,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:41,998 INFO L93 Difference]: Finished difference Result 620 states and 699 transitions. [2024-11-28 02:10:41,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:10:41,998 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-28 02:10:41,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:42,000 INFO L225 Difference]: With dead ends: 620 [2024-11-28 02:10:42,000 INFO L226 Difference]: Without dead ends: 620 [2024-11-28 02:10:42,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-28 02:10:42,000 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 481 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 2859 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 2875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:42,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 2640 Invalid, 2875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2859 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-28 02:10:42,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-28 02:10:42,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 617. [2024-11-28 02:10:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 452 states have (on average 1.5199115044247788) internal successors, (687), 610 states have internal predecessors, (687), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:10:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 694 transitions. [2024-11-28 02:10:42,009 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 694 transitions. Word has length 103 [2024-11-28 02:10:42,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:42,009 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 694 transitions. [2024-11-28 02:10:42,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:10:42,010 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 694 transitions. [2024-11-28 02:10:42,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-28 02:10:42,010 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:42,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:10:42,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 02:10:42,011 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:10:42,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:42,011 INFO L85 PathProgramCache]: Analyzing trace with hash 910322804, now seen corresponding path program 1 times [2024-11-28 02:10:42,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:42,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149425640] [2024-11-28 02:10:42,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:42,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:42,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:42,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:42,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149425640] [2024-11-28 02:10:42,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149425640] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:42,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977976515] [2024-11-28 02:10:42,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:42,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:10:42,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:10:42,937 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:10:42,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 02:10:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:43,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-28 02:10:43,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:10:43,332 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:10:43,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:10:43,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:10:43,432 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:43,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:10:43,489 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:43,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:10:43,548 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:43,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:10:43,613 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:43,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:10:43,681 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:43,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:10:43,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:10:43,729 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 02:10:43,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 02:10:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:43,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:10:44,656 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-28 02:10:44,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2024-11-28 02:10:44,679 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2260 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2260))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2253)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2254)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2255)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2256)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-28 02:10:44,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977976515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:44,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:10:44,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 23 [2024-11-28 02:10:44,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986798064] [2024-11-28 02:10:44,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:10:44,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 02:10:44,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:10:44,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 02:10:44,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=915, Unknown=48, NotChecked=64, Total=1190 [2024-11-28 02:10:44,683 INFO L87 Difference]: Start difference. First operand 617 states and 694 transitions. Second operand has 24 states, 21 states have (on average 6.238095238095238) internal successors, (131), 23 states have internal predecessors, (131), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:10:46,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:46,787 INFO L93 Difference]: Finished difference Result 619 states and 698 transitions. [2024-11-28 02:10:46,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:10:46,788 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.238095238095238) internal successors, (131), 23 states have internal predecessors, (131), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2024-11-28 02:10:46,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:46,790 INFO L225 Difference]: With dead ends: 619 [2024-11-28 02:10:46,790 INFO L226 Difference]: Without dead ends: 619 [2024-11-28 02:10:46,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=267, Invalid=1411, Unknown=48, NotChecked=80, Total=1806 [2024-11-28 02:10:46,792 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 468 mSDsluCounter, 3679 mSDsCounter, 0 mSdLazyCounter, 3092 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 4001 SdHoareTripleChecker+Invalid, 3111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:46,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 4001 Invalid, 3111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3092 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 02:10:46,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-28 02:10:46,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 616. [2024-11-28 02:10:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 452 states have (on average 1.5176991150442478) internal successors, (686), 609 states have internal predecessors, (686), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:10:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 693 transitions. [2024-11-28 02:10:46,810 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 693 transitions. Word has length 104 [2024-11-28 02:10:46,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:46,811 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 693 transitions. [2024-11-28 02:10:46,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.238095238095238) internal successors, (131), 23 states have internal predecessors, (131), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:10:46,812 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 693 transitions. [2024-11-28 02:10:46,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-28 02:10:46,813 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:46,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:10:46,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 02:10:47,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:10:47,014 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:10:47,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:47,015 INFO L85 PathProgramCache]: Analyzing trace with hash 910322805, now seen corresponding path program 1 times [2024-11-28 02:10:47,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:47,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823068233] [2024-11-28 02:10:47,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:47,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:48,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:48,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823068233] [2024-11-28 02:10:48,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823068233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:48,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062237441] [2024-11-28 02:10:48,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:48,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:10:48,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:10:48,593 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:10:48,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 02:10:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:48,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-28 02:10:48,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:10:49,041 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:10:49,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:10:49,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 02:10:49,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:10:49,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:10:49,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 02:10:49,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:10:49,379 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:49,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 73 treesize of output 66 [2024-11-28 02:10:49,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:10:49,537 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:49,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 02:10:49,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:10:49,659 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:49,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 02:10:49,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:10:49,810 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:49,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 02:10:49,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:10:49,929 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:49,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 02:10:49,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:10:49,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-28 02:10:49,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:10:50,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:10:50,062 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-28 02:10:50,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-28 02:10:50,085 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:10:50,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:10:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:50,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:11:10,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:11:10,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2024-11-28 02:11:11,506 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_21 Int)) (or (= |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_21) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_2443 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_ArrVal_2442 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_22))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_prenex_25))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_prenex_23))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_prenex_27))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_19) .cse0 v_prenex_24) .cse1 v_prenex_20) .cse2 v_prenex_18) .cse3 v_prenex_26) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| v_prenex_21 v_ArrVal_2443) (select (select (store .cse5 .cse3 v_ArrVal_2442) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2448 (Array Int Int)) (v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2436 (Array Int Int)) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2441 (Array Int Int)) (v_ArrVal_2440 (Array Int Int))) (< 0 (+ (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2448))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_2435))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_2437))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2449) .cse9 v_ArrVal_2436) .cse10 v_ArrVal_2438) .cse11 v_ArrVal_2439) (select (select (store .cse12 .cse11 v_ArrVal_2440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2441))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))))) is different from false [2024-11-28 02:11:11,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062237441] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:11:11,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:11:11,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2024-11-28 02:11:11,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263280781] [2024-11-28 02:11:11,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:11:11,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-28 02:11:11,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:11:11,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-28 02:11:11,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1653, Unknown=53, NotChecked=84, Total=1980 [2024-11-28 02:11:11,519 INFO L87 Difference]: Start difference. First operand 616 states and 693 transitions. Second operand has 33 states, 30 states have (on average 6.7) internal successors, (201), 32 states have internal predecessors, (201), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:11:42,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:11:42,369 INFO L93 Difference]: Finished difference Result 618 states and 697 transitions. [2024-11-28 02:11:42,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 02:11:42,369 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 6.7) internal successors, (201), 32 states have internal predecessors, (201), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2024-11-28 02:11:42,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:11:42,371 INFO L225 Difference]: With dead ends: 618 [2024-11-28 02:11:42,371 INFO L226 Difference]: Without dead ends: 618 [2024-11-28 02:11:42,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=346, Invalid=2467, Unknown=53, NotChecked=104, Total=2970 [2024-11-28 02:11:42,372 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 903 mSDsluCounter, 3884 mSDsCounter, 0 mSdLazyCounter, 5559 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 4131 SdHoareTripleChecker+Invalid, 5594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 5559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:11:42,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 4131 Invalid, 5594 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [35 Valid, 5559 Invalid, 0 Unknown, 0 Unchecked, 28.4s Time] [2024-11-28 02:11:42,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-28 02:11:42,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 596. [2024-11-28 02:11:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 434 states have (on average 1.5345622119815667) internal successors, (666), 590 states have internal predecessors, (666), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:11:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 672 transitions. [2024-11-28 02:11:42,383 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 672 transitions. Word has length 104 [2024-11-28 02:11:42,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:11:42,383 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 672 transitions. [2024-11-28 02:11:42,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 6.7) internal successors, (201), 32 states have internal predecessors, (201), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:11:42,383 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 672 transitions. [2024-11-28 02:11:42,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 02:11:42,384 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:11:42,384 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:11:42,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 02:11:42,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-28 02:11:42,585 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:11:42,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:11:42,586 INFO L85 PathProgramCache]: Analyzing trace with hash -612948337, now seen corresponding path program 1 times [2024-11-28 02:11:42,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:11:42,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6503562] [2024-11-28 02:11:42,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:11:42,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:11:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:11:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:11:44,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:11:44,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6503562] [2024-11-28 02:11:44,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6503562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:11:44,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:11:44,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 02:11:44,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387682021] [2024-11-28 02:11:44,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:11:44,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:11:44,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:11:44,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:11:44,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:11:44,150 INFO L87 Difference]: Start difference. First operand 596 states and 672 transitions. Second operand has 15 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:11:59,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:11:59,864 INFO L93 Difference]: Finished difference Result 622 states and 701 transitions. [2024-11-28 02:11:59,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:11:59,865 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-28 02:11:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:11:59,867 INFO L225 Difference]: With dead ends: 622 [2024-11-28 02:11:59,867 INFO L226 Difference]: Without dead ends: 622 [2024-11-28 02:11:59,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-11-28 02:11:59,867 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 503 mSDsluCounter, 3669 mSDsCounter, 0 mSdLazyCounter, 3007 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 3994 SdHoareTripleChecker+Invalid, 3020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:11:59,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 3994 Invalid, 3020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3007 Invalid, 0 Unknown, 0 Unchecked, 14.9s Time] [2024-11-28 02:11:59,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-28 02:11:59,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 618. [2024-11-28 02:11:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 455 states have (on average 1.5142857142857142) internal successors, (689), 611 states have internal predecessors, (689), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:11:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 696 transitions. [2024-11-28 02:11:59,877 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 696 transitions. Word has length 106 [2024-11-28 02:11:59,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:11:59,877 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 696 transitions. [2024-11-28 02:11:59,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:11:59,877 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 696 transitions. [2024-11-28 02:11:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 02:11:59,878 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:11:59,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:11:59,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 02:11:59,878 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:11:59,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:11:59,878 INFO L85 PathProgramCache]: Analyzing trace with hash -612948336, now seen corresponding path program 1 times [2024-11-28 02:11:59,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:11:59,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100857909] [2024-11-28 02:11:59,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:11:59,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:11:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:12:03,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:12:03,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:12:03,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100857909] [2024-11-28 02:12:03,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100857909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:12:03,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:12:03,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 02:12:03,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201041900] [2024-11-28 02:12:03,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:12:03,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 02:12:03,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:12:03,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 02:12:03,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:12:03,188 INFO L87 Difference]: Start difference. First operand 618 states and 696 transitions. Second operand has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 18 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:12:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:12:18,640 INFO L93 Difference]: Finished difference Result 621 states and 700 transitions. [2024-11-28 02:12:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 02:12:18,641 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 18 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-28 02:12:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:12:18,643 INFO L225 Difference]: With dead ends: 621 [2024-11-28 02:12:18,643 INFO L226 Difference]: Without dead ends: 621 [2024-11-28 02:12:18,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-28 02:12:18,644 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 502 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 2768 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 2716 SdHoareTripleChecker+Invalid, 2784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:12:18,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 2716 Invalid, 2784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2768 Invalid, 0 Unknown, 0 Unchecked, 14.1s Time] [2024-11-28 02:12:18,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-28 02:12:18,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 618. [2024-11-28 02:12:18,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 455 states have (on average 1.512087912087912) internal successors, (688), 611 states have internal predecessors, (688), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:12:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 695 transitions. [2024-11-28 02:12:18,653 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 695 transitions. Word has length 106 [2024-11-28 02:12:18,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:12:18,654 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 695 transitions. [2024-11-28 02:12:18,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 18 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:12:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 695 transitions. [2024-11-28 02:12:18,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-28 02:12:18,654 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:12:18,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:12:18,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 02:12:18,655 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:12:18,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:12:18,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1003793498, now seen corresponding path program 1 times [2024-11-28 02:12:18,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:12:18,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119969705] [2024-11-28 02:12:18,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:12:18,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:12:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:12:19,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:12:19,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:12:19,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119969705] [2024-11-28 02:12:19,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119969705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:12:19,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:12:19,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:12:19,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767898730] [2024-11-28 02:12:19,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:12:19,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:12:19,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:12:19,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:12:19,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:12:19,679 INFO L87 Difference]: Start difference. First operand 618 states and 695 transitions. Second operand has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:12:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:12:22,732 INFO L93 Difference]: Finished difference Result 617 states and 694 transitions. [2024-11-28 02:12:22,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:12:22,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2024-11-28 02:12:22,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:12:22,734 INFO L225 Difference]: With dead ends: 617 [2024-11-28 02:12:22,734 INFO L226 Difference]: Without dead ends: 617 [2024-11-28 02:12:22,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:12:22,734 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 2 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:12:22,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1591 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-28 02:12:22,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-28 02:12:22,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2024-11-28 02:12:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 455 states have (on average 1.5098901098901099) internal successors, (687), 610 states have internal predecessors, (687), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:12:22,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 694 transitions. [2024-11-28 02:12:22,744 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 694 transitions. Word has length 107 [2024-11-28 02:12:22,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:12:22,744 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 694 transitions. [2024-11-28 02:12:22,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:12:22,744 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 694 transitions. [2024-11-28 02:12:22,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-28 02:12:22,745 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:12:22,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:12:22,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-28 02:12:22,746 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:12:22,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:12:22,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1003793499, now seen corresponding path program 1 times [2024-11-28 02:12:22,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:12:22,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160901205] [2024-11-28 02:12:22,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:12:22,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:12:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:12:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:12:26,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:12:26,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160901205] [2024-11-28 02:12:26,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160901205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:12:26,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885405552] [2024-11-28 02:12:26,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:12:26,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:12:26,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:12:26,314 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:12:26,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 02:12:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:12:26,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-28 02:12:26,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:12:27,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 02:12:27,340 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:12:27,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:12:27,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:12:27,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:12:28,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 02:12:28,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:12:28,820 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:12:28,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:12:28,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:12:29,346 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:12:29,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 02:12:29,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:12:29,876 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:12:29,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 02:12:29,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:12:30,352 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:12:30,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 02:12:30,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:12:30,810 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:12:30,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 02:12:30,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:12:31,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:12:31,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 02:12:31,185 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:12:31,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:12:31,286 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:12:31,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:12:31,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:12:31,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:12:31,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:12:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:12:31,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:12:31,839 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2904 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 44) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2903 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 40))))) is different from false [2024-11-28 02:12:32,725 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_9|) 0)) (forall ((v_ArrVal_2902 Int) (v_ArrVal_2904 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2901))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2900) .cse0 v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2902) (select (select (store .cse2 .cse0 v_ArrVal_2904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_9|) 0))) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2900) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2901) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 40)))))) is different from false [2024-11-28 02:12:49,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:12:49,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2024-11-28 02:12:50,031 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (or (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2904 (Array Int Int)) (v_ArrVal_2902 Int) (v_ArrVal_2903 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2895))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2896))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2898))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2901))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 43 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2894) .cse0 v_ArrVal_2897) .cse1 v_ArrVal_2899) .cse2 v_ArrVal_2900) .cse3 v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2902) (select (select (store .cse5 .cse3 v_ArrVal_2904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_9| |c_ULTIMATE.start_main_#t~mem53#1.base|))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_37 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_prenex_34))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_prenex_33))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_prenex_31))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_prenex_35) .cse9 v_prenex_32) .cse10 v_prenex_30) .cse11 v_prenex_29) (select (select (store .cse12 .cse11 v_prenex_28) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_37))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))) is different from false [2024-11-28 02:12:54,329 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_9| .cse0) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2904 (Array Int Int)) (v_ArrVal_2902 Int) (v_ArrVal_2903 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2895))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_2896))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_2898))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_2901))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2894) .cse1 v_ArrVal_2897) .cse2 v_ArrVal_2899) .cse3 v_ArrVal_2900) .cse4 v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2902) (select (select (store .cse6 .cse4 v_ArrVal_2904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_37 (Array Int Int))) (< 0 (+ (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_34))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_prenex_33))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_prenex_31))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_35) .cse10 v_prenex_32) .cse11 v_prenex_30) .cse12 v_prenex_29) (select (select (store .cse13 .cse12 v_prenex_28) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_37))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 41)))))) is different from false [2024-11-28 02:12:58,975 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2910 (Array Int Int)) (v_ArrVal_2909 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2909))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2904 (Array Int Int)) (v_ArrVal_2902 Int) (v_ArrVal_2903 (Array Int Int))) (let ((.cse9 (store .cse10 .cse0 v_ArrVal_2895))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_2896))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_2898))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_2901))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2910) .cse0 v_ArrVal_2894) .cse1 v_ArrVal_2897) .cse2 v_ArrVal_2899) .cse3 v_ArrVal_2900) .cse4 v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2902) (select (select (store .cse6 .cse4 v_ArrVal_2904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_9| .cse0))))) (forall ((v_ArrVal_2910 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_ArrVal_2909 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_37 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2909))) (let ((.cse11 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse11 v_prenex_34))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse12 v_prenex_33))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse13 v_prenex_31))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2910) .cse11 v_prenex_35) .cse12 v_prenex_32) .cse13 v_prenex_30) .cse14 v_prenex_29) (select (select (store .cse15 .cse14 v_prenex_28) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_37))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))) is different from false [2024-11-28 02:12:59,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885405552] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:12:59,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:12:59,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 28 [2024-11-28 02:12:59,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999955870] [2024-11-28 02:12:59,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:12:59,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-28 02:12:59,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:12:59,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-28 02:12:59,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1185, Unknown=42, NotChecked=380, Total=1806 [2024-11-28 02:12:59,026 INFO L87 Difference]: Start difference. First operand 617 states and 694 transitions. Second operand has 29 states, 26 states have (on average 5.423076923076923) internal successors, (141), 28 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:13:22,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:13:22,968 INFO L93 Difference]: Finished difference Result 619 states and 698 transitions. [2024-11-28 02:13:22,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 02:13:22,969 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 5.423076923076923) internal successors, (141), 28 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2024-11-28 02:13:22,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:13:22,970 INFO L225 Difference]: With dead ends: 619 [2024-11-28 02:13:22,971 INFO L226 Difference]: Without dead ends: 619 [2024-11-28 02:13:22,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=362, Invalid=2166, Unknown=42, NotChecked=510, Total=3080 [2024-11-28 02:13:22,972 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 490 mSDsluCounter, 2654 mSDsCounter, 0 mSdLazyCounter, 3070 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 2974 SdHoareTripleChecker+Invalid, 3091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:13:22,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 2974 Invalid, 3091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3070 Invalid, 0 Unknown, 0 Unchecked, 21.0s Time] [2024-11-28 02:13:22,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-28 02:13:22,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 594. [2024-11-28 02:13:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 434 states have (on average 1.5299539170506913) internal successors, (664), 588 states have internal predecessors, (664), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:13:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 670 transitions. [2024-11-28 02:13:22,980 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 670 transitions. Word has length 107 [2024-11-28 02:13:22,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:13:22,980 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 670 transitions. [2024-11-28 02:13:22,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 5.423076923076923) internal successors, (141), 28 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:13:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 670 transitions. [2024-11-28 02:13:22,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-28 02:13:22,981 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:13:22,981 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:13:22,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 02:13:23,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-28 02:13:23,182 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:13:23,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:13:23,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1857688454, now seen corresponding path program 1 times [2024-11-28 02:13:23,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:13:23,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57621021] [2024-11-28 02:13:23,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:13:23,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:13:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:13:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:13:25,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:13:25,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57621021] [2024-11-28 02:13:25,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57621021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:13:25,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:13:25,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 02:13:25,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618490459] [2024-11-28 02:13:25,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:13:25,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 02:13:25,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:13:25,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 02:13:25,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:13:25,655 INFO L87 Difference]: Start difference. First operand 594 states and 670 transitions. Second operand has 17 states, 16 states have (on average 6.6875) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:13:44,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:13:44,095 INFO L93 Difference]: Finished difference Result 645 states and 726 transitions. [2024-11-28 02:13:44,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:13:44,096 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.6875) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-28 02:13:44,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:13:44,098 INFO L225 Difference]: With dead ends: 645 [2024-11-28 02:13:44,098 INFO L226 Difference]: Without dead ends: 645 [2024-11-28 02:13:44,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-11-28 02:13:44,098 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 513 mSDsluCounter, 2863 mSDsCounter, 0 mSdLazyCounter, 2538 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 3194 SdHoareTripleChecker+Invalid, 2553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:13:44,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 3194 Invalid, 2553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2538 Invalid, 0 Unknown, 0 Unchecked, 17.1s Time] [2024-11-28 02:13:44,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-11-28 02:13:44,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 619. [2024-11-28 02:13:44,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 458 states have (on average 1.5065502183406114) internal successors, (690), 612 states have internal predecessors, (690), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:13:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 697 transitions. [2024-11-28 02:13:44,106 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 697 transitions. Word has length 109 [2024-11-28 02:13:44,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:13:44,107 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 697 transitions. [2024-11-28 02:13:44,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.6875) internal successors, (107), 17 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:13:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 697 transitions. [2024-11-28 02:13:44,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-28 02:13:44,108 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:13:44,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:13:44,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-28 02:13:44,109 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:13:44,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:13:44,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1857688455, now seen corresponding path program 1 times [2024-11-28 02:13:44,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:13:44,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077377775] [2024-11-28 02:13:44,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:13:44,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:13:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:13:47,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:13:47,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:13:47,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077377775] [2024-11-28 02:13:47,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077377775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:13:47,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:13:47,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 02:13:47,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274075513] [2024-11-28 02:13:47,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:13:47,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:13:47,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:13:47,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:13:47,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:13:47,261 INFO L87 Difference]: Start difference. First operand 619 states and 697 transitions. Second operand has 16 states, 15 states have (on average 7.133333333333334) internal successors, (107), 16 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:14:05,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:14:05,633 INFO L93 Difference]: Finished difference Result 644 states and 725 transitions. [2024-11-28 02:14:05,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:14:05,634 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.133333333333334) internal successors, (107), 16 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-28 02:14:05,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:14:05,636 INFO L225 Difference]: With dead ends: 644 [2024-11-28 02:14:05,636 INFO L226 Difference]: Without dead ends: 644 [2024-11-28 02:14:05,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-11-28 02:14:05,637 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 532 mSDsluCounter, 2374 mSDsCounter, 0 mSdLazyCounter, 2483 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 2701 SdHoareTripleChecker+Invalid, 2499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:14:05,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 2701 Invalid, 2499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2483 Invalid, 0 Unknown, 0 Unchecked, 16.9s Time] [2024-11-28 02:14:05,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-11-28 02:14:05,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 619. [2024-11-28 02:14:05,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 458 states have (on average 1.5043668122270741) internal successors, (689), 612 states have internal predecessors, (689), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:14:05,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 696 transitions. [2024-11-28 02:14:05,646 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 696 transitions. Word has length 109 [2024-11-28 02:14:05,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:14:05,646 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 696 transitions. [2024-11-28 02:14:05,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.133333333333334) internal successors, (107), 16 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:14:05,646 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 696 transitions. [2024-11-28 02:14:05,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-28 02:14:05,647 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:14:05,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:14:05,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-28 02:14:05,647 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:14:05,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:14:05,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1844529701, now seen corresponding path program 1 times [2024-11-28 02:14:05,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:14:05,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135917160] [2024-11-28 02:14:05,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:14:05,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:14:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:14:08,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:14:08,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:14:08,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135917160] [2024-11-28 02:14:08,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135917160] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:14:08,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764685978] [2024-11-28 02:14:08,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:14:08,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:14:08,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:14:08,803 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:14:08,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 02:14:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:14:09,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-28 02:14:09,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:14:10,249 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:14:10,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:14:10,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:14:10,634 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:14:10,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:14:11,047 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:14:11,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:14:11,470 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:14:11,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:14:11,895 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:14:11,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:14:12,310 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:14:12,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:14:12,655 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:14:12,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:14:13,101 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:14:13,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:14:13,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:14:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:14:13,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:14:13,309 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-28 02:14:13,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-28 02:14:13,339 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3291 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem59#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3291) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-28 02:14:13,381 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3291 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-28 02:14:13,431 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3290 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3290)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_3291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2024-11-28 02:14:13,482 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3290 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3290))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_3291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 02:14:13,534 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3290 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3289))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3290)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_3291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 02:14:13,570 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3290 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3289))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3290)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_3291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-28 02:14:13,637 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3290 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3288))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3289)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3290)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_3291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 02:14:13,676 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3290 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3288))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3289)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3290)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_3291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-28 02:14:13,736 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3287 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3290 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3287))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3288)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3289)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3290)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_3291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 02:14:13,800 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3287 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3290 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3287))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3288)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3289)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3290)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_3291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-28 02:14:13,880 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3286 (Array Int Int)) (v_ArrVal_3287 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3290 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3286))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3287)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3288)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3289)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3290)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_3291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 02:14:13,942 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3286 (Array Int Int)) (v_ArrVal_3287 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3290 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3286))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3287)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3288)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3289)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3290)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_3291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-28 02:14:16,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764685978] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:14:16,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:14:16,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 23 [2024-11-28 02:14:16,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046133949] [2024-11-28 02:14:16,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:14:16,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 02:14:16,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:14:16,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 02:14:16,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=538, Unknown=17, NotChecked=684, Total=1332 [2024-11-28 02:14:16,178 INFO L87 Difference]: Start difference. First operand 619 states and 696 transitions. Second operand has 24 states, 22 states have (on average 6.136363636363637) internal successors, (135), 24 states have internal predecessors, (135), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:14:46,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:14:46,951 INFO L93 Difference]: Finished difference Result 635 states and 714 transitions. [2024-11-28 02:14:46,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 02:14:46,952 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 6.136363636363637) internal successors, (135), 24 states have internal predecessors, (135), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2024-11-28 02:14:46,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:14:46,954 INFO L225 Difference]: With dead ends: 635 [2024-11-28 02:14:46,954 INFO L226 Difference]: Without dead ends: 635 [2024-11-28 02:14:46,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=180, Invalid=1111, Unknown=17, NotChecked=948, Total=2256 [2024-11-28 02:14:46,956 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 506 mSDsluCounter, 5205 mSDsCounter, 0 mSdLazyCounter, 4159 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 5528 SdHoareTripleChecker+Invalid, 4181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:14:46,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 5528 Invalid, 4181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4159 Invalid, 0 Unknown, 0 Unchecked, 28.8s Time] [2024-11-28 02:14:46,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-28 02:14:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 618. [2024-11-28 02:14:46,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 458 states have (on average 1.502183406113537) internal successors, (688), 611 states have internal predecessors, (688), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 02:14:46,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 695 transitions. [2024-11-28 02:14:46,966 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 695 transitions. Word has length 110 [2024-11-28 02:14:46,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:14:46,966 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 695 transitions. [2024-11-28 02:14:46,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 6.136363636363637) internal successors, (135), 24 states have internal predecessors, (135), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:14:46,966 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 695 transitions. [2024-11-28 02:14:46,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-28 02:14:46,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:14:46,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:14:46,980 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 02:14:47,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-28 02:14:47,168 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:14:47,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:14:47,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1844529700, now seen corresponding path program 1 times [2024-11-28 02:14:47,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:14:47,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464067880] [2024-11-28 02:14:47,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:14:47,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:14:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:14:50,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:14:50,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:14:50,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464067880] [2024-11-28 02:14:50,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464067880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:14:50,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017772456] [2024-11-28 02:14:50,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:14:50,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:14:50,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:14:50,650 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:14:50,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 02:14:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:14:51,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-28 02:14:51,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:14:51,964 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:14:51,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:14:52,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:14:52,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:14:53,002 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:14:53,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:14:53,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:14:53,440 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:14:53,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:14:53,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:14:53,886 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:14:53,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:14:53,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:14:54,340 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:14:54,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 51 treesize of output 48 [2024-11-28 02:14:54,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:14:54,822 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:14:54,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:14:54,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:14:55,398 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:14:55,398 INFO L378 Elim1Store]: Elim1 eliminated variable 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 70 treesize of output 65 [2024-11-28 02:14:55,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-28 02:14:56,267 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:14:56,268 INFO L378 Elim1Store]: Elim1 eliminated variable 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 70 treesize of output 65 [2024-11-28 02:14:56,284 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 49 treesize of output 30 [2024-11-28 02:14:56,393 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 39 treesize of output 21 [2024-11-28 02:14:56,409 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 32 treesize of output 14 [2024-11-28 02:14:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:14:56,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:14:57,065 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3502 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3502) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-11-28 02:14:57,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:14:57,648 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 82 treesize of output 86 [2024-11-28 02:14:57,853 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_prenex_40))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~mem57#1.base|)) (forall ((v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3501) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_prenex_41) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ |c_ULTIMATE.start_main_#t~mem57#1.offset| 1))))) is different from false [2024-11-28 02:14:58,497 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3498))) (< (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3499))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_prenex_41) (select (select (store .cse2 .cse1 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3499))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3498) .cse4 v_ArrVal_3501) (select (select (store .cse5 .cse4 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3503))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3499))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (let ((.cse6 (store .cse7 .cse8 v_prenex_40))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse8)))))) is different from false [2024-11-28 02:15:03,860 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3496))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3497) .cse5 v_ArrVal_3498))) (< (select (select (let ((.cse2 (store .cse4 .cse5 v_ArrVal_3499))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_prenex_41) (select (select (store .cse2 .cse1 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))))) (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3496))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3499))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3497) .cse6 v_ArrVal_3498) .cse7 v_ArrVal_3501) (select (select (store .cse8 .cse7 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3503))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3496))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3499)))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse10 (select (select (let ((.cse11 (store .cse12 .cse10 v_prenex_40))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2024-11-28 02:15:04,069 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3496))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3499)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_prenex_40))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3496))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_3497) .cse10 v_ArrVal_3498))) (< (select (select (let ((.cse8 (store .cse9 .cse10 v_ArrVal_3499))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store .cse6 .cse7 v_prenex_41) (select (select (store .cse8 .cse7 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)))))) (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3496))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_3499))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_3497) .cse11 v_ArrVal_3498) .cse12 v_ArrVal_3501) (select (select (store .cse13 .cse12 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3503))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 02:15:04,524 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3495))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_3496))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3494) .cse6 v_ArrVal_3497) .cse5 v_ArrVal_3498))) (< (select (select (let ((.cse2 (store .cse4 .cse5 v_ArrVal_3499))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_prenex_41) (select (select (store .cse2 .cse1 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))))))) (forall ((v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3495))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3496)))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3499)))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse8 (select (select (let ((.cse9 (store .cse10 .cse8 v_prenex_40))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3495))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_3496))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_3499))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3494) .cse13 v_ArrVal_3497) .cse14 v_ArrVal_3498) .cse15 v_ArrVal_3501) (select (select (store .cse16 .cse15 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3503))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) is different from false [2024-11-28 02:15:04,973 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (forall ((v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3495))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3496))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3499))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3494) .cse1 v_ArrVal_3497) .cse2 v_ArrVal_3498) .cse3 v_ArrVal_3501) (select (select (store .cse4 .cse3 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3503))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3495))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3496)))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3499)))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= .cse8 (select (select (let ((.cse9 (store .cse10 .cse8 v_prenex_40))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))) (forall ((v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3495))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse19 .cse18 v_ArrVal_3496))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3494) .cse18 v_ArrVal_3497) .cse17 v_ArrVal_3498))) (< (select (select (let ((.cse15 (store .cse16 .cse17 v_ArrVal_3499))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store .cse13 .cse14 v_prenex_41) (select (select (store .cse15 .cse14 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (+ (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1))))))))))) is different from false [2024-11-28 02:15:05,419 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3492 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3493))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_3495))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3496))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3499))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3492) .cse0 v_ArrVal_3494) .cse1 v_ArrVal_3497) .cse2 v_ArrVal_3498) .cse3 v_ArrVal_3501) (select (select (store .cse4 .cse3 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3503))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_3492 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3493))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_3495))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse16 .cse15 v_ArrVal_3496))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse9 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3492) .cse14 v_ArrVal_3494) .cse15 v_ArrVal_3497) .cse13 v_ArrVal_3498))) (< (select (select (let ((.cse11 (store .cse12 .cse13 v_ArrVal_3499))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store .cse9 .cse10 v_prenex_41) (select (select (store .cse11 .cse10 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (+ (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1)))))))))) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse20 (let ((.cse21 (let ((.cse22 (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3493))) (store .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3495)))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3496)))) (store .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3499)))) (let ((.cse18 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= .cse18 (select (select (let ((.cse19 (store .cse20 .cse18 v_prenex_40))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))) is different from false [2024-11-28 02:15:06,534 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (and (forall ((v_ArrVal_3492 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3493))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3495))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3496))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_3499))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3492) .cse1 v_ArrVal_3494) .cse2 v_ArrVal_3497) .cse3 v_ArrVal_3498) .cse4 v_ArrVal_3501) (select (select (store .cse5 .cse4 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3503))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3493))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3495)))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3496)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3499)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (= (select (select (let ((.cse10 (store .cse11 .cse12 v_prenex_40))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) .cse12)))) (forall ((v_ArrVal_3492 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3493))) (let ((.cse21 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse23 (store .cse24 .cse21 v_ArrVal_3495))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse19 (store .cse23 .cse22 v_ArrVal_3496))) (let ((.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse16 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3492) .cse21 v_ArrVal_3494) .cse22 v_ArrVal_3497) .cse20 v_ArrVal_3498))) (< (select (select (let ((.cse18 (store .cse19 .cse20 v_ArrVal_3499))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store .cse16 .cse17 v_prenex_41) (select (select (store .cse18 .cse17 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (+ (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 1))))))))))))) is different from false [2024-11-28 02:15:10,922 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3508 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_3508))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3493)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3495)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3496)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3499)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_prenex_40))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3508 (Array Int Int)) (v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3492 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_3508))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_3493))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_3495))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse11 (store .cse16 .cse15 v_ArrVal_3496))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_3509) .cse13 v_ArrVal_3492) .cse14 v_ArrVal_3494) .cse15 v_ArrVal_3497) .cse12 v_ArrVal_3498))) (< (select (select (let ((.cse10 (store .cse11 .cse12 v_ArrVal_3499))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store .cse8 .cse9 v_prenex_41) (select (select (store .cse10 .cse9 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)))))))))))) (forall ((v_ArrVal_3508 (Array Int Int)) (v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3492 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_3508))) (let ((.cse19 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse27 (store .cse28 .cse19 v_ArrVal_3493))) (let ((.cse20 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse26 (store .cse27 .cse20 v_ArrVal_3495))) (let ((.cse21 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse25 (store .cse26 .cse21 v_ArrVal_3496))) (let ((.cse22 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse24 (store .cse25 .cse22 v_ArrVal_3499))) (let ((.cse23 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_3509) .cse19 v_ArrVal_3492) .cse20 v_ArrVal_3494) .cse21 v_ArrVal_3497) .cse22 v_ArrVal_3498) .cse23 v_ArrVal_3501) (select (select (store .cse24 .cse23 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3503))))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 02:15:10,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017772456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:15:10,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:15:10,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2024-11-28 02:15:10,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861862381] [2024-11-28 02:15:10,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:15:10,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-28 02:15:10,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:15:10,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-28 02:15:10,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=909, Unknown=35, NotChecked=710, Total=1806 [2024-11-28 02:15:10,937 INFO L87 Difference]: Start difference. First operand 618 states and 695 transitions. Second operand has 29 states, 26 states have (on average 5.730769230769231) internal successors, (149), 29 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:15:37,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:15:37,344 INFO L93 Difference]: Finished difference Result 634 states and 713 transitions. [2024-11-28 02:15:37,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 02:15:37,345 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 5.730769230769231) internal successors, (149), 29 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2024-11-28 02:15:37,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:15:37,346 INFO L225 Difference]: With dead ends: 634 [2024-11-28 02:15:37,346 INFO L226 Difference]: Without dead ends: 634 [2024-11-28 02:15:37,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=294, Invalid=1690, Unknown=36, NotChecked=950, Total=2970 [2024-11-28 02:15:37,349 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 566 mSDsluCounter, 3198 mSDsCounter, 0 mSdLazyCounter, 3408 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 3516 SdHoareTripleChecker+Invalid, 3435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:15:37,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 3516 Invalid, 3435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3408 Invalid, 0 Unknown, 0 Unchecked, 23.5s Time] [2024-11-28 02:15:37,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-28 02:15:37,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 592. [2024-11-28 02:15:37,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 434 states have (on average 1.5253456221198156) internal successors, (662), 586 states have internal predecessors, (662), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:15:37,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 668 transitions. [2024-11-28 02:15:37,361 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 668 transitions. Word has length 110 [2024-11-28 02:15:37,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:15:37,361 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 668 transitions. [2024-11-28 02:15:37,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 5.730769230769231) internal successors, (149), 29 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:15:37,361 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 668 transitions. [2024-11-28 02:15:37,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-28 02:15:37,362 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:15:37,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:15:37,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 02:15:37,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:15:37,563 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:15:37,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:15:37,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1743797443, now seen corresponding path program 1 times [2024-11-28 02:15:37,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:15:37,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099873974] [2024-11-28 02:15:37,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:15:37,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:15:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:15:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:15:37,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:15:37,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099873974] [2024-11-28 02:15:37,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099873974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:15:37,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:15:37,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:15:37,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825080574] [2024-11-28 02:15:37,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:15:37,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:15:37,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:15:37,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:15:37,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:15:37,815 INFO L87 Difference]: Start difference. First operand 592 states and 668 transitions. Second operand has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:15:41,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:15:41,834 INFO L93 Difference]: Finished difference Result 591 states and 667 transitions. [2024-11-28 02:15:41,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:15:41,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-28 02:15:41,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:15:41,836 INFO L225 Difference]: With dead ends: 591 [2024-11-28 02:15:41,836 INFO L226 Difference]: Without dead ends: 591 [2024-11-28 02:15:41,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:15:41,837 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 5 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:15:41,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1571 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-28 02:15:41,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-11-28 02:15:41,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2024-11-28 02:15:41,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 434 states have (on average 1.523041474654378) internal successors, (661), 585 states have internal predecessors, (661), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:15:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 667 transitions. [2024-11-28 02:15:41,846 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 667 transitions. Word has length 112 [2024-11-28 02:15:41,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:15:41,846 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 667 transitions. [2024-11-28 02:15:41,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:15:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 667 transitions. [2024-11-28 02:15:41,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-28 02:15:41,847 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:15:41,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:15:41,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-28 02:15:41,847 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:15:41,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:15:41,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1743797444, now seen corresponding path program 1 times [2024-11-28 02:15:41,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:15:41,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020666957] [2024-11-28 02:15:41,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:15:41,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:15:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:15:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:15:42,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:15:42,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020666957] [2024-11-28 02:15:42,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020666957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:15:42,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:15:42,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:15:42,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761967723] [2024-11-28 02:15:42,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:15:42,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:15:42,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:15:42,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:15:42,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:15:42,336 INFO L87 Difference]: Start difference. First operand 591 states and 667 transitions. Second operand has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:15:46,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:15:46,689 INFO L93 Difference]: Finished difference Result 590 states and 666 transitions. [2024-11-28 02:15:46,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:15:46,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-28 02:15:46,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:15:46,691 INFO L225 Difference]: With dead ends: 590 [2024-11-28 02:15:46,691 INFO L226 Difference]: Without dead ends: 590 [2024-11-28 02:15:46,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:15:46,692 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 4 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:15:46,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1577 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-28 02:15:46,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-28 02:15:46,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2024-11-28 02:15:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 434 states have (on average 1.5207373271889402) internal successors, (660), 584 states have internal predecessors, (660), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:15:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 666 transitions. [2024-11-28 02:15:46,700 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 666 transitions. Word has length 112 [2024-11-28 02:15:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:15:46,700 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 666 transitions. [2024-11-28 02:15:46,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:15:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 666 transitions. [2024-11-28 02:15:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-28 02:15:46,701 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:15:46,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:15:46,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-28 02:15:46,702 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:15:46,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:15:46,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1776853430, now seen corresponding path program 1 times [2024-11-28 02:15:46,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:15:46,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547550393] [2024-11-28 02:15:46,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:15:46,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:15:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:15:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:15:50,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:15:50,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547550393] [2024-11-28 02:15:50,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547550393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:15:50,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:15:50,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 02:15:50,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467870714] [2024-11-28 02:15:50,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:15:50,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 02:15:50,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:15:50,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 02:15:50,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:15:50,734 INFO L87 Difference]: Start difference. First operand 590 states and 666 transitions. Second operand has 19 states, 18 states have (on average 6.166666666666667) internal successors, (111), 19 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:16:15,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:16:15,404 INFO L93 Difference]: Finished difference Result 638 states and 719 transitions. [2024-11-28 02:16:15,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 02:16:15,405 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.166666666666667) internal successors, (111), 19 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2024-11-28 02:16:15,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:16:15,407 INFO L225 Difference]: With dead ends: 638 [2024-11-28 02:16:15,407 INFO L226 Difference]: Without dead ends: 638 [2024-11-28 02:16:15,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2024-11-28 02:16:15,408 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 501 mSDsluCounter, 3767 mSDsCounter, 0 mSdLazyCounter, 3156 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 4096 SdHoareTripleChecker+Invalid, 3173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:16:15,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 4096 Invalid, 3173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3156 Invalid, 0 Unknown, 0 Unchecked, 22.5s Time] [2024-11-28 02:16:15,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-28 02:16:15,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 619. [2024-11-28 02:16:15,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 462 states have (on average 1.4913419913419914) internal successors, (689), 612 states have internal predecessors, (689), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 02:16:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 698 transitions. [2024-11-28 02:16:15,424 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 698 transitions. Word has length 113 [2024-11-28 02:16:15,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:16:15,425 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 698 transitions. [2024-11-28 02:16:15,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.166666666666667) internal successors, (111), 19 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:16:15,425 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 698 transitions. [2024-11-28 02:16:15,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-28 02:16:15,426 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:16:15,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:16:15,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-28 02:16:15,427 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:16:15,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:16:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1776853429, now seen corresponding path program 1 times [2024-11-28 02:16:15,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:16:15,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520427542] [2024-11-28 02:16:15,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:16:15,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:16:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:16:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:16:19,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:16:19,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520427542] [2024-11-28 02:16:19,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520427542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:16:19,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:16:19,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 02:16:19,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563647825] [2024-11-28 02:16:19,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:16:19,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 02:16:19,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:16:19,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 02:16:19,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:16:19,324 INFO L87 Difference]: Start difference. First operand 619 states and 698 transitions. Second operand has 19 states, 18 states have (on average 6.166666666666667) internal successors, (111), 19 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:16:46,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:16:46,531 INFO L93 Difference]: Finished difference Result 637 states and 718 transitions. [2024-11-28 02:16:46,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 02:16:46,532 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.166666666666667) internal successors, (111), 19 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2024-11-28 02:16:46,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:16:46,535 INFO L225 Difference]: With dead ends: 637 [2024-11-28 02:16:46,535 INFO L226 Difference]: Without dead ends: 637 [2024-11-28 02:16:46,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2024-11-28 02:16:46,536 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 520 mSDsluCounter, 3706 mSDsCounter, 0 mSdLazyCounter, 3550 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 4028 SdHoareTripleChecker+Invalid, 3570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:16:46,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 4028 Invalid, 3570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3550 Invalid, 0 Unknown, 0 Unchecked, 25.1s Time] [2024-11-28 02:16:46,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-28 02:16:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 619. [2024-11-28 02:16:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 461 states have (on average 1.492407809110629) internal successors, (688), 612 states have internal predecessors, (688), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 02:16:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 697 transitions. [2024-11-28 02:16:46,547 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 697 transitions. Word has length 113 [2024-11-28 02:16:46,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:16:46,547 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 697 transitions. [2024-11-28 02:16:46,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.166666666666667) internal successors, (111), 19 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 02:16:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 697 transitions. [2024-11-28 02:16:46,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-28 02:16:46,549 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:16:46,549 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:16:46,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-28 02:16:46,549 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:16:46,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:16:46,550 INFO L85 PathProgramCache]: Analyzing trace with hash -554119649, now seen corresponding path program 1 times [2024-11-28 02:16:46,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:16:46,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844349716] [2024-11-28 02:16:46,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:16:46,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:16:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:16:51,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:16:51,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:16:51,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844349716] [2024-11-28 02:16:51,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844349716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:16:51,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283270004] [2024-11-28 02:16:51,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:16:51,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:16:51,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:16:51,479 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:16:51,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 02:16:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:16:51,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-28 02:16:51,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:16:52,958 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:16:52,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:16: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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:16:53,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:16:53,969 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:16:53,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:16:53,985 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 20 treesize of output 1 [2024-11-28 02:16:54,379 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:16:54,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 51 treesize of output 48 [2024-11-28 02:16:54,396 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 20 treesize of output 1 [2024-11-28 02:16:54,807 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:16:54,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:16:54,825 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 20 treesize of output 1 [2024-11-28 02:16:55,256 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:16:55,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:16:55,287 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 20 treesize of output 1 [2024-11-28 02:16:55,718 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:16:55,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:16:55,734 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 20 treesize of output 1 [2024-11-28 02:16:56,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 [2024-11-28 02:16:56,618 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-28 02:16:56,618 INFO L378 Elim1Store]: Elim1 eliminated variable 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 97 treesize of output 63 [2024-11-28 02:16:56,634 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 42 treesize of output 25 [2024-11-28 02:16:57,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:16:57,546 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-28 02:16:57,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 58 [2024-11-28 02:16:57,563 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 42 treesize of output 25 [2024-11-28 02:16:57,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-28 02:16:58,110 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-28 02:16:58,111 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 39 treesize of output 16 [2024-11-28 02:16:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:16:58,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:16:58,280 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4079 (Array Int Int))) (or (not (= v_ArrVal_4078 (let ((.cse0 (+ 40 |c_ULTIMATE.start_main_#t~mem59#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base|) .cse0 (select v_ArrVal_4078 .cse0))))) (= (select |c_#valid| (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4078))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) 1))) is different from false [2024-11-28 02:16:58,355 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select |c_#memory_$Pointer$#1.base| .cse1) .cse2 (select v_ArrVal_4078 .cse2))) v_ArrVal_4078)) (= (select |c_#valid| (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4078))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1))))) is different from false [2024-11-28 02:16:58,550 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |c_ULTIMATE.start_main_#t~malloc58#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4076))) (or (= (select |c_#valid| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_ArrVal_4078 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4078 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:16:58,591 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 272 treesize of output 184 [2024-11-28 02:16:58,744 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_16|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4076)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4078 (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4078 .cse4))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-28 02:16:58,889 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse6 (store (select |c_#memory_$Pointer$#1.base| .cse6) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_4076))) (or (= (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4078 .cse5))) v_ArrVal_4078)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-28 02:16:59,237 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4074 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4073)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4074))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4076)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4078 (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4078 .cse4))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-28 02:16:59,459 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4074 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4074))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_4076)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4078 .cse5))) v_ArrVal_4078)))))))))) is different from false [2024-11-28 02:16:59,999 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4074 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4071)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse10 .cse9 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4072) .cse9 v_ArrVal_4074))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4076)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4078))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4078 .cse5))) v_ArrVal_4078)))))))))) is different from false [2024-11-28 02:17:00,160 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4074 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4071))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4072) .cse10 v_ArrVal_4074))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse6 .cse7 v_ArrVal_4076))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4078 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4078 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-11-28 02:17:00,457 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (v_ArrVal_4070 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4074 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4069)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4071))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4070) .cse9 v_ArrVal_4072) .cse10 v_ArrVal_4074))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4076)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4078))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4078 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4078 .cse5))))))))))))))) is different from false [2024-11-28 02:17:00,630 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (v_ArrVal_4070 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4074 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4069))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4071))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4070) .cse10 v_ArrVal_4072) .cse11 v_ArrVal_4074))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4076)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4078))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4078 .cse5))) v_ArrVal_4078)))))))))))))) is different from false [2024-11-28 02:17:00,974 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4070 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (v_ArrVal_4074 (Array Int Int)) (v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4068 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4068)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4069))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4071))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4067) .cse9 v_ArrVal_4070) .cse10 v_ArrVal_4072) .cse11 v_ArrVal_4074))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_4076)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4078 .cse2))) v_ArrVal_4078)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4078))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-11-28 02:17:01,156 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4070 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (v_ArrVal_4074 (Array Int Int)) (v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4068 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4068))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4069))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4071))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4067) .cse10 v_ArrVal_4070) .cse11 v_ArrVal_4072) .cse12 v_ArrVal_4074))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4076)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4078 .cse4))) v_ArrVal_4078)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))))) is different from false [2024-11-28 02:17:01,757 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4070 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4084 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (v_ArrVal_4085 (Array Int Int)) (v_ArrVal_4074 (Array Int Int)) (v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4068 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4084)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_4068))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4069))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4071))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4085) .cse9 v_ArrVal_4067) .cse10 v_ArrVal_4070) .cse11 v_ArrVal_4072) .cse12 v_ArrVal_4074))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_4076)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4078 .cse2))) v_ArrVal_4078)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4078))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))))) is different from false [2024-11-28 02:17:01,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283270004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:17:01,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:17:01,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 32 [2024-11-28 02:17:01,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392526805] [2024-11-28 02:17:01,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:17:01,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-28 02:17:01,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:17:01,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-28 02:17:01,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=962, Unknown=14, NotChecked=1050, Total=2162 [2024-11-28 02:17:01,771 INFO L87 Difference]: Start difference. First operand 619 states and 697 transitions. Second operand has 33 states, 30 states have (on average 5.2) internal successors, (156), 33 states have internal predecessors, (156), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:17:33,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:17:33,838 INFO L93 Difference]: Finished difference Result 635 states and 716 transitions. [2024-11-28 02:17:33,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 02:17:33,839 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 5.2) internal successors, (156), 33 states have internal predecessors, (156), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 114 [2024-11-28 02:17:33,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:17:33,841 INFO L225 Difference]: With dead ends: 635 [2024-11-28 02:17:33,841 INFO L226 Difference]: Without dead ends: 635 [2024-11-28 02:17:33,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=254, Invalid=1950, Unknown=14, NotChecked=1442, Total=3660 [2024-11-28 02:17:33,843 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 523 mSDsluCounter, 4956 mSDsCounter, 0 mSdLazyCounter, 4043 mSolverCounterSat, 24 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 5277 SdHoareTripleChecker+Invalid, 4069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4043 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:17:33,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 5277 Invalid, 4069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4043 Invalid, 2 Unknown, 0 Unchecked, 28.9s Time] [2024-11-28 02:17:33,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-28 02:17:33,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 618. [2024-11-28 02:17:33,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 461 states have (on average 1.490238611713666) internal successors, (687), 611 states have internal predecessors, (687), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-28 02:17:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 696 transitions. [2024-11-28 02:17:33,854 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 696 transitions. Word has length 114 [2024-11-28 02:17:33,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:17:33,854 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 696 transitions. [2024-11-28 02:17:33,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 5.2) internal successors, (156), 33 states have internal predecessors, (156), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:17:33,854 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 696 transitions. [2024-11-28 02:17:33,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-28 02:17:33,855 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:17:33,855 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:17:33,869 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 02:17:34,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-11-28 02:17:34,056 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:17:34,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:17:34,057 INFO L85 PathProgramCache]: Analyzing trace with hash -554119648, now seen corresponding path program 1 times [2024-11-28 02:17:34,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:17:34,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550342687] [2024-11-28 02:17:34,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:17:34,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:17:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:17:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:17:39,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:17:39,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550342687] [2024-11-28 02:17:39,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550342687] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:17:39,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551193499] [2024-11-28 02:17:39,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:17:39,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:17:39,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:17:39,276 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:17:39,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 02:17:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:17:39,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-28 02:17:39,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:17:40,729 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:17:40,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:17:41,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:17:41,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:17:41,775 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:17:41,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:17:41,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-28 02:17:42,189 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:17:42,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:17:42,207 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 20 treesize of output 1 [2024-11-28 02:17:42,647 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:17:42,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:17:42,670 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 20 treesize of output 1 [2024-11-28 02:17:43,113 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:17:43,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:17:43,145 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 20 treesize of output 1 [2024-11-28 02:17:43,602 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:17:43,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:17:43,618 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 20 treesize of output 1 [2024-11-28 02:17:44,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 02:17:44,566 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-28 02:17:44,566 INFO L378 Elim1Store]: Elim1 eliminated variable 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 106 treesize of output 72 [2024-11-28 02:17:44,583 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 51 treesize of output 41 [2024-11-28 02:17:45,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:17:45,615 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-28 02:17:45,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 82 [2024-11-28 02:17:45,730 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-28 02:17:45,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 47 [2024-11-28 02:17:46,913 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-28 02:17:46,913 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 70 treesize of output 29 [2024-11-28 02:17:47,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:17:47,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:17:48,668 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base|)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base|)) (.cse6 (+ 40 |c_ULTIMATE.start_main_#t~mem59#1.offset|))) (and (forall ((v_ArrVal_4295 (Array Int Int))) (or (forall ((v_ArrVal_4297 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| (store .cse5 .cse6 v_ArrVal_4297))) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4295))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select .cse0 .cse1) .cse2) 384) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (= (store .cse7 .cse6 (select v_ArrVal_4295 .cse6)) v_ArrVal_4295)))) (forall ((v_ArrVal_4295 (Array Int Int))) (or (forall ((v_ArrVal_4297 Int)) (<= 0 (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| (store .cse5 .cse6 v_ArrVal_4297)))) (select (select .cse8 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) (not (= (store .cse7 .cse6 (select v_ArrVal_4295 .cse6)) v_ArrVal_4295)))))) is different from false [2024-11-28 02:17:48,887 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse1 (select |c_#memory_$Pointer$#1.base| .cse8)) (.cse9 (select |c_#memory_$Pointer$#1.offset| .cse8))) (and (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse0) (forall ((v_ArrVal_4295 (Array Int Int))) (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= v_ArrVal_4295 (store .cse1 .cse2 (select v_ArrVal_4295 .cse2)))) (forall ((v_ArrVal_4297 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse8 (store .cse9 .cse2 v_ArrVal_4297))) (.cse6 (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_4295))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse5 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (<= (+ (select (select .cse3 .cse4) .cse5) 384) (select |c_#length| (select (select .cse6 .cse4) .cse5))))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse0) (forall ((v_ArrVal_4295 (Array Int Int))) (let ((.cse10 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= v_ArrVal_4295 (store .cse1 .cse10 (select v_ArrVal_4295 .cse10)))) (forall ((v_ArrVal_4297 Int)) (<= 0 (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse8 (store .cse9 .cse10 v_ArrVal_4297)))) (select (select .cse11 (select (select (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)))))))))))))) is different from false [2024-11-28 02:17:49,274 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |c_ULTIMATE.start_main_#t~malloc58#1.base|))) (.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |c_ULTIMATE.start_main_#t~malloc58#1.offset|)))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse11 (select .cse6 .cse7)) (.cse9 (select .cse8 .cse7))) (and (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse0) (forall ((v_ArrVal_4295 (Array Int Int))) (let ((.cse10 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (forall ((v_ArrVal_4297 Int)) (let ((.cse1 (store .cse8 .cse7 (store .cse9 .cse10 v_ArrVal_4297))) (.cse4 (store .cse6 .cse7 v_ArrVal_4295))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ (select (select .cse1 .cse2) .cse3) 384) (select |c_#length| (select (select .cse4 .cse2) .cse3)))))) (not (= v_ArrVal_4295 (store .cse11 .cse10 (select v_ArrVal_4295 .cse10))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse0) (forall ((v_ArrVal_4295 (Array Int Int))) (let ((.cse12 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= v_ArrVal_4295 (store .cse11 .cse12 (select v_ArrVal_4295 .cse12)))) (forall ((v_ArrVal_4297 Int)) (<= 0 (let ((.cse13 (store .cse8 .cse7 (store .cse9 .cse12 v_ArrVal_4297)))) (select (select .cse13 (select (select (store .cse6 .cse7 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))) is different from false [2024-11-28 02:17:49,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 942 treesize of output 820 [2024-11-28 02:17:50,339 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| 0))) (.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|))) (and (forall ((v_prenex_60 (Array Int Int)) (v_prenex_62 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse2 (+ 40 v_prenex_62))) (or (not (= (store (select .cse0 .cse1) .cse2 (select v_prenex_60 .cse2)) v_prenex_60)) (< v_prenex_62 .cse3) (< 0 (+ (let ((.cse4 (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 v_prenex_61)))) (select (select .cse4 (select (select (store .cse0 .cse1 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1)))))) (forall ((v_ArrVal_4295 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse10 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= (store (select .cse8 .cse9) .cse10 (select v_ArrVal_4295 .cse10)) v_ArrVal_4295)) (= (select (let ((.cse11 (store .cse8 .cse9 v_ArrVal_4295))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (select (select (store .cse6 .cse9 (store (select .cse6 .cse9) .cse10 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) |v_ULTIMATE.start_main_#t~malloc58#1.base_19|) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse3))))) (forall ((v_ArrVal_4295 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse14 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= (store (select .cse12 .cse13) .cse14 (select v_ArrVal_4295 .cse14)) v_ArrVal_4295)) (< (let ((.cse15 (store .cse6 .cse13 (store (select .cse6 .cse13) .cse14 v_ArrVal_4297)))) (select (select .cse15 (select (select (store .cse12 .cse13 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse3)))))))) is different from false [2024-11-28 02:17:52,560 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4289)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4290))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse4 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4295))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 (store (select .cse4 .cse3) .cse5 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4295 .cse5)))))))))) (forall ((v_prenex_60 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4289)) (.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4290))) (let ((.cse16 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse17 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse18 .cse16 (store (select .cse18 .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse13 (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 0))) (.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse12 (+ 40 v_prenex_62))) (or (not (= (store (select .cse10 .cse11) .cse12 (select v_prenex_60 .cse12)) v_prenex_60)) (< v_prenex_62 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse14 (store .cse13 .cse11 (store (select .cse13 .cse11) .cse12 v_prenex_61)))) (select (select .cse14 (select (select (store .cse10 .cse11 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse24 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4289)) (.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4290))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse20 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse19 (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0))) (.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse22 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (select .cse20 .cse21) .cse22 (select v_ArrVal_4295 .cse22)))) (< (let ((.cse23 (store .cse19 .cse21 (store (select .cse19 .cse21) .cse22 v_ArrVal_4297)))) (select (select .cse23 (select (select (store .cse20 .cse21 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1))))))))) is different from false [2024-11-28 02:17:53,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_4289)) (.cse6 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_4290))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0))) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< (let ((.cse1 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store .cse4 .cse2 (store (select .cse4 .cse2) .cse5 v_ArrVal_4297)))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_ArrVal_4295 (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4290 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse5 (select v_ArrVal_4295 .cse5))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse17 (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_4289)) (.cse20 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_4290))) (let ((.cse18 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse19 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse13 (store .cse20 .cse18 (store (select .cse20 .cse18) .cse19 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse15 (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 0))) (.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse16 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (= (select (let ((.cse12 (store .cse13 .cse14 v_ArrVal_4295))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse15 .cse14 (store (select .cse15 .cse14) .cse16 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) |v_ULTIMATE.start_main_#t~malloc58#1.base_19|) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_ArrVal_4295 (store (select .cse13 .cse14) .cse16 (select v_ArrVal_4295 .cse16)))))))))) (forall ((v_prenex_60 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse30 (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_4289)) (.cse22 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_4290))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse24 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse26 (store .cse30 .cse23 (store (select .cse30 .cse23) .cse24 0))) (.cse25 (+ 40 v_prenex_62))) (or (not (= (store (let ((.cse21 (store .cse22 .cse23 (store v_ArrVal_4290 .cse24 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse25 (select v_prenex_60 .cse25)) v_prenex_60)) (< v_prenex_62 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (< 0 (+ (let ((.cse28 (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse27 (store .cse26 .cse29 (store (select .cse26 .cse29) .cse25 v_prenex_61)))) (select (select .cse27 (select (select (store .cse28 .cse29 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) 1)))))))))) is different from false [2024-11-28 02:17:56,570 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_60 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse6 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0))) (.cse5 (+ 40 v_prenex_62))) (or (< v_prenex_62 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse3 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse0 .cse4 (store (select .cse0 .cse4) .cse5 v_prenex_61)))) (select (select .cse2 (select (select (store .cse3 .cse4 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (not (= v_prenex_60 (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4290 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_prenex_60 .cse5))))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4287))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse22 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4288) .cse24 v_ArrVal_4289)) (.cse18 (store .cse23 .cse24 v_ArrVal_4290))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse20 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse22 .cse19 (store (select .cse22 .cse19) .cse20 0))) (.cse17 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< (let ((.cse14 (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse16 .cse15 (store (select .cse16 .cse15) .cse17 v_ArrVal_4297)))) (select (select .cse13 (select (select (store .cse14 .cse15 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (let ((.cse21 (store .cse18 .cse19 (store v_ArrVal_4290 .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse17 (select v_ArrVal_4295 .cse17))))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse34 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4287))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse30 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4288) .cse35 v_ArrVal_4289)) (.cse33 (store .cse34 .cse35 v_ArrVal_4290))) (let ((.cse31 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse32 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store .cse33 .cse31 (store (select .cse33 .cse31) .cse32 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse25 (store .cse30 .cse31 (store (select .cse30 .cse31) .cse32 0))) (.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse28 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (select .cse26 .cse27) .cse28 (select v_ArrVal_4295 .cse28)))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse29 (store .cse26 .cse27 v_ArrVal_4295))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse25 .cse27 (store (select .cse25 .cse27) .cse28 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2024-11-28 02:17:59,130 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse6 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0))) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse3 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse0 .cse4 (store (select .cse0 .cse4) .cse5 v_ArrVal_4297)))) (select (select .cse2 (select (select (store .cse3 .cse4 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (not (= (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4290 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_ArrVal_4295 .cse5)) v_ArrVal_4295))))))))) (forall ((v_prenex_60 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4287))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse23 (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4288) .cse25 v_ArrVal_4289)) (.cse19 (store .cse24 .cse25 v_ArrVal_4290))) (let ((.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse21 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse17 (store .cse23 .cse20 (store (select .cse23 .cse20) .cse21 0))) (.cse18 (+ 40 v_prenex_62))) (or (< 0 (+ (let ((.cse15 (store .cse19 .cse20 (store (select .cse19 .cse20) .cse21 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse17 .cse16 (store (select .cse17 .cse16) .cse18 v_prenex_61)))) (select (select .cse14 (select (select (store .cse15 .cse16 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (< v_prenex_62 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_prenex_60 (store (let ((.cse22 (store .cse19 .cse20 (store v_ArrVal_4290 .cse21 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse18 (select v_prenex_60 .cse18))))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse35 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4287))) (let ((.cse36 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4288) .cse36 v_ArrVal_4289)) (.cse34 (store .cse35 .cse36 v_ArrVal_4290))) (let ((.cse32 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse33 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse28 (store .cse34 .cse32 (store (select .cse34 .cse32) .cse33 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse26 (store .cse31 .cse32 (store (select .cse31 .cse32) .cse33 0))) (.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse30 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse27 (store .cse28 .cse29 v_ArrVal_4295))) (select .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse26 .cse29 (store (select .cse26 .cse29) .cse30 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4295 (store (select .cse28 .cse29) .cse30 (select v_ArrVal_4295 .cse30))))))))))))))) is different from false [2024-11-28 02:18:18,391 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4286))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4285) .cse13 v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse3 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse10 .cse4 (store (select .cse10 .cse4) .cse5 0))) (.cse6 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (let ((.cse2 (store .cse3 .cse4 (store v_ArrVal_4290 .cse5 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse6 (select v_ArrVal_4295 .cse6)) v_ArrVal_4295)) (< (let ((.cse8 (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse0 .cse9 (store (select .cse0 .cse9) .cse6 v_ArrVal_4297)))) (select (select .cse7 (select (select (store .cse8 .cse9 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)))))))))) (forall ((v_ArrVal_4285 (Array Int Int)) (v_prenex_60 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4286))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store .cse28 .cse27 v_ArrVal_4287))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4285) .cse27 v_ArrVal_4288) .cse26 v_ArrVal_4289)) (.cse16 (store .cse25 .cse26 v_ArrVal_4290))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse18 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse19 (+ 40 v_prenex_62)) (.cse23 (store .cse24 .cse17 (store (select .cse24 .cse17) .cse18 0)))) (or (not (= v_prenex_60 (store (let ((.cse15 (store .cse16 .cse17 (store v_ArrVal_4290 .cse18 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse19 (select v_prenex_60 .cse19)))) (< 0 (+ (let ((.cse21 (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse20 (store .cse23 .cse22 (store (select .cse23 .cse22) .cse19 v_prenex_61)))) (select (select .cse20 (select (select (store .cse21 .cse22 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (< v_prenex_62 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse41 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4286))) (let ((.cse40 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse38 (store .cse41 .cse40 v_ArrVal_4287))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse34 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4285) .cse40 v_ArrVal_4288) .cse39 v_ArrVal_4289)) (.cse37 (store .cse38 .cse39 v_ArrVal_4290))) (let ((.cse35 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse36 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse29 (store .cse37 .cse35 (store (select .cse37 .cse35) .cse36 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse32 (store .cse34 .cse35 (store (select .cse34 .cse35) .cse36 0))) (.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse31 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= (store (select .cse29 .cse30) .cse31 (select v_ArrVal_4295 .cse31)) v_ArrVal_4295)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse33 (store .cse29 .cse30 v_ArrVal_4295))) (select .cse33 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse32 .cse30 (store (select .cse32 .cse30) .cse31 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) is different from false [2024-11-28 02:18:19,122 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4285 (Array Int Int)) (v_prenex_60 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4286))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse15 .cse14 v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4285) .cse14 v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse6 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0))) (.cse5 (+ 40 v_prenex_62))) (or (< v_prenex_62 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse3 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse0 .cse4 (store (select .cse0 .cse4) .cse5 v_prenex_61)))) (select (select .cse2 (select (select (store .cse3 .cse4 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (not (= v_prenex_60 (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4290 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_prenex_60 .cse5))))))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4286))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store .cse28 .cse27 v_ArrVal_4287))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse21 (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4285) .cse27 v_ArrVal_4288) .cse26 v_ArrVal_4289)) (.cse24 (store .cse25 .cse26 v_ArrVal_4290))) (let ((.cse22 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse23 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse17 (store .cse24 .cse22 (store (select .cse24 .cse22) .cse23 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse19 (store .cse21 .cse22 (store (select .cse21 .cse22) .cse23 0))) (.cse18 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse20 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse16 (store .cse17 .cse18 v_ArrVal_4295))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse19 .cse18 (store (select .cse19 .cse18) .cse20 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (select .cse17 .cse18) .cse20 (select v_ArrVal_4295 .cse20)))))))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse42 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4286))) (let ((.cse41 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse39 (store .cse42 .cse41 v_ArrVal_4287))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse38 (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4285) .cse41 v_ArrVal_4288) .cse40 v_ArrVal_4289)) (.cse31 (store .cse39 .cse40 v_ArrVal_4290))) (let ((.cse32 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse33 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse29 (store .cse38 .cse32 (store (select .cse38 .cse32) .cse33 0))) (.cse34 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (let ((.cse30 (store .cse31 .cse32 (store v_ArrVal_4290 .cse33 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse30 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse34 (select v_ArrVal_4295 .cse34)))) (< (let ((.cse36 (store .cse31 .cse32 (store (select .cse31 .cse32) .cse33 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse37 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse35 (store .cse29 .cse37 (store (select .cse29 .cse37) .cse34 v_ArrVal_4297)))) (select (select .cse35 (select (select (store .cse36 .cse37 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1))))))))))))) is different from false [2024-11-28 02:18:20,231 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4283 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4284))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_4286))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse15 .cse14 v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4283) .cse13 v_ArrVal_4285) .cse14 v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse2 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse9 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0)))) (or (not (= v_ArrVal_4295 (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4290 .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_ArrVal_4295 .cse5)))) (< (let ((.cse7 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store .cse9 .cse8 (store (select .cse9 .cse8) .cse5 v_ArrVal_4297)))) (select (select .cse6 (select (select (store .cse7 .cse8 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_prenex_60 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int) (v_ArrVal_4283 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4284))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store .cse32 .cse29 v_ArrVal_4286))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse27 (store .cse31 .cse30 v_ArrVal_4287))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4283) .cse29 v_ArrVal_4285) .cse30 v_ArrVal_4288) .cse28 v_ArrVal_4289)) (.cse18 (store .cse27 .cse28 v_ArrVal_4290))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse20 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse22 (store .cse26 .cse19 (store (select .cse26 .cse19) .cse20 0))) (.cse21 (+ 40 v_prenex_62))) (or (not (= (store (let ((.cse17 (store .cse18 .cse19 (store v_ArrVal_4290 .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse21 (select v_prenex_60 .cse21)) v_prenex_60)) (< v_prenex_62 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse24 (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse23 (store .cse22 .cse25 (store (select .cse22 .cse25) .cse21 v_prenex_61)))) (select (select .cse23 (select (select (store .cse24 .cse25 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1))))))))))))) (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4283 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4284))) (let ((.cse44 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse46 (store .cse47 .cse44 v_ArrVal_4286))) (let ((.cse45 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse42 (store .cse46 .cse45 v_ArrVal_4287))) (let ((.cse43 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse38 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4283) .cse44 v_ArrVal_4285) .cse45 v_ArrVal_4288) .cse43 v_ArrVal_4289)) (.cse41 (store .cse42 .cse43 v_ArrVal_4290))) (let ((.cse39 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse40 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store .cse41 .cse39 (store (select .cse41 .cse39) .cse40 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse34 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse35 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse37 (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 0)))) (or (not (= v_ArrVal_4295 (store (select .cse33 .cse34) .cse35 (select v_ArrVal_4295 .cse35)))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse36 (store .cse33 .cse34 v_ArrVal_4295))) (select .cse36 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse37 .cse34 (store (select .cse37 .cse34) .cse35 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) is different from false [2024-11-28 02:18:21,013 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_prenex_60 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int) (v_ArrVal_4283 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4284))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_4286))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse16 .cse15 v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4283) .cse14 v_ArrVal_4285) .cse15 v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse2 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0))) (.cse5 (+ 40 v_prenex_62))) (or (not (= v_prenex_60 (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4290 .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_prenex_60 .cse5)))) (< v_prenex_62 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse8 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse6 .cse9 (store (select .cse6 .cse9) .cse5 v_prenex_61)))) (select (select .cse7 (select (select (store .cse8 .cse9 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1))))))))))))) (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4283 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4284))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store .cse32 .cse29 v_ArrVal_4286))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse27 (store .cse31 .cse30 v_ArrVal_4287))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse23 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4283) .cse29 v_ArrVal_4285) .cse30 v_ArrVal_4288) .cse28 v_ArrVal_4289)) (.cse26 (store .cse27 .cse28 v_ArrVal_4290))) (let ((.cse24 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse25 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse19 (store .cse26 .cse24 (store (select .cse26 .cse24) .cse25 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse18 (store .cse23 .cse24 (store (select .cse23 .cse24) .cse25 0))) (.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse21 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse19 .cse20) .cse21 (select v_ArrVal_4295 .cse21)) v_ArrVal_4295)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse22 (store .cse19 .cse20 v_ArrVal_4295))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse18 .cse20 (store (select .cse18 .cse20) .cse21 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4283 (Array Int Int))) (let ((.cse48 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4284))) (let ((.cse45 (select (select .cse48 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse47 (store .cse48 .cse45 v_ArrVal_4286))) (let ((.cse46 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse43 (store .cse47 .cse46 v_ArrVal_4287))) (let ((.cse44 (select (select .cse43 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse42 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4283) .cse45 v_ArrVal_4285) .cse46 v_ArrVal_4288) .cse44 v_ArrVal_4289)) (.cse38 (store .cse43 .cse44 v_ArrVal_4290))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse40 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store .cse42 .cse39 (store (select .cse42 .cse39) .cse40 0))) (.cse37 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse35 (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse36 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse34 (store .cse33 .cse36 (store (select .cse33 .cse36) .cse37 v_ArrVal_4297)))) (select (select .cse34 (select (select (store .cse35 .cse36 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (not (= v_ArrVal_4295 (store (let ((.cse41 (store .cse38 .cse39 (store v_ArrVal_4290 .cse40 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse41 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse37 (select v_ArrVal_4295 .cse37)))))))))))))))))) is different from false [2024-11-28 02:18:22,437 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (v_ArrVal_4283 (Array Int Int)) (v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4302 (Array Int Int)) (v_ArrVal_4303 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4302))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_4284))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_4286))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse16 .cse15 v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4303) .cse13 v_ArrVal_4283) .cse14 v_ArrVal_4285) .cse15 v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse3 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse10 .cse4 (store (select .cse10 .cse4) .cse5 0))) (.cse6 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (let ((.cse2 (store .cse3 .cse4 (store v_ArrVal_4290 .cse5 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse6 (select v_ArrVal_4295 .cse6)))) (< (let ((.cse8 (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse0 .cse9 (store (select .cse0 .cse9) .cse6 v_ArrVal_4297)))) (select (select .cse7 (select (select (store .cse8 .cse9 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)))))))))))))) (forall ((v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (v_ArrVal_4283 (Array Int Int)) (v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4302 (Array Int Int)) (v_ArrVal_4303 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse35 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4302))) (let ((.cse30 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse34 (store .cse35 .cse30 v_ArrVal_4284))) (let ((.cse31 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store .cse34 .cse31 v_ArrVal_4286))) (let ((.cse32 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse28 (store .cse33 .cse32 v_ArrVal_4287))) (let ((.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4303) .cse30 v_ArrVal_4283) .cse31 v_ArrVal_4285) .cse32 v_ArrVal_4288) .cse29 v_ArrVal_4289)) (.cse27 (store .cse28 .cse29 v_ArrVal_4290))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse20 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse19 (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0))) (.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse22 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse20 .cse21) .cse22 (select v_ArrVal_4295 .cse22)) v_ArrVal_4295)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse23 (store .cse20 .cse21 v_ArrVal_4295))) (select .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse19 .cse21 (store (select .cse19 .cse21) .cse22 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))))) (forall ((v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int) (v_ArrVal_4283 (Array Int Int)) (v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_prenex_60 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4302 (Array Int Int)) (v_ArrVal_4303 (Array Int Int))) (let ((.cse53 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4302))) (let ((.cse48 (select (select .cse53 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse52 (store .cse53 .cse48 v_ArrVal_4284))) (let ((.cse49 (select (select .cse52 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse51 (store .cse52 .cse49 v_ArrVal_4286))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse46 (store .cse51 .cse50 v_ArrVal_4287))) (let ((.cse47 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse45 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4303) .cse48 v_ArrVal_4283) .cse49 v_ArrVal_4285) .cse50 v_ArrVal_4288) .cse47 v_ArrVal_4289)) (.cse37 (store .cse46 .cse47 v_ArrVal_4290))) (let ((.cse38 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse39 (select (select .cse45 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse40 (+ 40 v_prenex_62)) (.cse44 (store .cse45 .cse38 (store (select .cse45 .cse38) .cse39 0)))) (or (not (= v_prenex_60 (store (let ((.cse36 (store .cse37 .cse38 (store v_ArrVal_4290 .cse39 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse36 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse40 (select v_prenex_60 .cse40)))) (< 0 (+ (let ((.cse42 (store .cse37 .cse38 (store (select .cse37 .cse38) .cse39 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse43 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse41 (store .cse44 .cse43 (store (select .cse44 .cse43) .cse40 v_prenex_61)))) (select (select .cse41 (select (select (store .cse42 .cse43 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (< v_prenex_62 (select (select .cse44 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))))) is different from false [2024-11-28 02:18:22,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551193499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:18:22,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:18:22,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 34 [2024-11-28 02:18:22,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538610357] [2024-11-28 02:18:22,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:18:22,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-28 02:18:22,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:18:22,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-28 02:18:22,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1344, Unknown=14, NotChecked=1118, Total=2652 [2024-11-28 02:18:22,617 INFO L87 Difference]: Start difference. First operand 618 states and 696 transitions. Second operand has 35 states, 32 states have (on average 4.90625) internal successors, (157), 35 states have internal predecessors, (157), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:19:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:19:05,058 INFO L93 Difference]: Finished difference Result 634 states and 715 transitions. [2024-11-28 02:19:05,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 02:19:05,058 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 4.90625) internal successors, (157), 35 states have internal predecessors, (157), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 114 [2024-11-28 02:19:05,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:19:05,060 INFO L225 Difference]: With dead ends: 634 [2024-11-28 02:19:05,060 INFO L226 Difference]: Without dead ends: 634 [2024-11-28 02:19:05,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 38.2s TimeCoverageRelationStatistics Valid=328, Invalid=2572, Unknown=14, NotChecked=1508, Total=4422 [2024-11-28 02:19:05,061 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 507 mSDsluCounter, 5166 mSDsCounter, 0 mSdLazyCounter, 5020 mSolverCounterSat, 24 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 5484 SdHoareTripleChecker+Invalid, 5046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5020 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:19:05,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 5484 Invalid, 5046 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 5020 Invalid, 2 Unknown, 0 Unchecked, 38.0s Time] [2024-11-28 02:19:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-28 02:19:05,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 588. [2024-11-28 02:19:05,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 433 states have (on average 1.5196304849884525) internal successors, (658), 582 states have internal predecessors, (658), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:19:05,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 664 transitions. [2024-11-28 02:19:05,070 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 664 transitions. Word has length 114 [2024-11-28 02:19:05,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:19:05,070 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 664 transitions. [2024-11-28 02:19:05,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 4.90625) internal successors, (157), 35 states have internal predecessors, (157), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:19:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 664 transitions. [2024-11-28 02:19:05,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-28 02:19:05,071 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:19:05,071 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:19:05,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 02:19:05,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-11-28 02:19:05,272 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr135REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:19:05,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:19:05,272 INFO L85 PathProgramCache]: Analyzing trace with hash -655482028, now seen corresponding path program 1 times [2024-11-28 02:19:05,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:19:05,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057299726] [2024-11-28 02:19:05,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:19:05,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:19:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:19:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 02:19:05,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:19:05,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057299726] [2024-11-28 02:19:05,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057299726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:19:05,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:19:05,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:19:05,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255990761] [2024-11-28 02:19:05,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:19:05,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:19:05,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:19:05,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:19:05,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:19:05,473 INFO L87 Difference]: Start difference. First operand 588 states and 664 transitions. Second operand has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:19:08,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:19:08,195 INFO L93 Difference]: Finished difference Result 691 states and 799 transitions. [2024-11-28 02:19:08,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:19:08,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 123 [2024-11-28 02:19:08,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:19:08,197 INFO L225 Difference]: With dead ends: 691 [2024-11-28 02:19:08,197 INFO L226 Difference]: Without dead ends: 691 [2024-11-28 02:19:08,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:19:08,198 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 887 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:19:08,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 600 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-28 02:19:08,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-11-28 02:19:08,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2024-11-28 02:19:08,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 543 states have (on average 1.4604051565377532) internal successors, (793), 685 states have internal predecessors, (793), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:19:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 799 transitions. [2024-11-28 02:19:08,210 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 799 transitions. Word has length 123 [2024-11-28 02:19:08,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:19:08,210 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 799 transitions. [2024-11-28 02:19:08,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:19:08,211 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 799 transitions. [2024-11-28 02:19:08,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-28 02:19:08,212 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:19:08,212 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:19:08,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-28 02:19:08,212 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr136REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:19:08,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:19:08,213 INFO L85 PathProgramCache]: Analyzing trace with hash -655482027, now seen corresponding path program 1 times [2024-11-28 02:19:08,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:19:08,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237640276] [2024-11-28 02:19:08,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:19:08,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:19:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:19:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 02:19:08,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:19:08,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237640276] [2024-11-28 02:19:08,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237640276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:19:08,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:19:08,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:19:08,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534808802] [2024-11-28 02:19:08,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:19:08,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:19:08,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:19:08,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:19:08,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:19:08,613 INFO L87 Difference]: Start difference. First operand 691 states and 799 transitions. Second operand has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:19:12,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:19:12,501 INFO L93 Difference]: Finished difference Result 902 states and 1046 transitions. [2024-11-28 02:19:12,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:19:12,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 123 [2024-11-28 02:19:12,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:19:12,503 INFO L225 Difference]: With dead ends: 902 [2024-11-28 02:19:12,503 INFO L226 Difference]: Without dead ends: 902 [2024-11-28 02:19:12,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:19:12,504 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 838 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:19:12,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 754 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-28 02:19:12,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-11-28 02:19:12,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 856. [2024-11-28 02:19:12,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 708 states have (on average 1.4562146892655368) internal successors, (1031), 850 states have internal predecessors, (1031), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 02:19:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1037 transitions. [2024-11-28 02:19:12,517 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1037 transitions. Word has length 123 [2024-11-28 02:19:12,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:19:12,517 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1037 transitions. [2024-11-28 02:19:12,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:19:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1037 transitions. [2024-11-28 02:19:12,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-28 02:19:12,518 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:19:12,519 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:19:12,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-28 02:19:12,520 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:19:12,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:19:12,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1154894375, now seen corresponding path program 1 times [2024-11-28 02:19:12,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:19:12,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689771894] [2024-11-28 02:19:12,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:19:12,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:19:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:19:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:19:12,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:19:12,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689771894] [2024-11-28 02:19:12,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689771894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:19:12,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398520463] [2024-11-28 02:19:12,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:19:12,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:19:12,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:19:12,981 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:19:12,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 02:19:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:19:13,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-28 02:19:13,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:19:14,645 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:19:14,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:19:14,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:19:15,558 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:19:15,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:19:15,884 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:19:15,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:19:16,204 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:19:16,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:19:16,562 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:19:16,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:19:16,945 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:19:16,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:19:17,612 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:19:17,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:19:17,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 02:19:18,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:19:18,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:19:18,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:19:18,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398520463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:19:18,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:19:18,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [4] total 20 [2024-11-28 02:19:18,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108980199] [2024-11-28 02:19:18,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:19:18,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:19:18,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:19:18,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:19:18,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2024-11-28 02:19:18,979 INFO L87 Difference]: Start difference. First operand 856 states and 1037 transitions. Second operand has 18 states, 16 states have (on average 7.5) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:19:37,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:19:37,844 INFO L93 Difference]: Finished difference Result 897 states and 1082 transitions. [2024-11-28 02:19:37,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 02:19:37,845 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 7.5) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 124 [2024-11-28 02:19:37,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:19:37,847 INFO L225 Difference]: With dead ends: 897 [2024-11-28 02:19:37,847 INFO L226 Difference]: Without dead ends: 897 [2024-11-28 02:19:37,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2024-11-28 02:19:37,848 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 503 mSDsluCounter, 2809 mSDsCounter, 0 mSdLazyCounter, 2406 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 3131 SdHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:19:37,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 3131 Invalid, 2428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2406 Invalid, 0 Unknown, 0 Unchecked, 16.7s Time] [2024-11-28 02:19:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-11-28 02:19:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 893. [2024-11-28 02:19:37,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 743 states have (on average 1.4360699865410498) internal successors, (1067), 885 states have internal predecessors, (1067), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-28 02:19:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1079 transitions. [2024-11-28 02:19:37,862 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1079 transitions. Word has length 124 [2024-11-28 02:19:37,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:19:37,862 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1079 transitions. [2024-11-28 02:19:37,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 7.5) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:19:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1079 transitions. [2024-11-28 02:19:37,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-28 02:19:37,863 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:19:37,863 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:19:37,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-28 02:19:38,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-11-28 02:19:38,064 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr138REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:19:38,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:19:38,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1154894376, now seen corresponding path program 1 times [2024-11-28 02:19:38,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:19:38,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126046379] [2024-11-28 02:19:38,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:19:38,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:19:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:19:38,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:19:38,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:19:38,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126046379] [2024-11-28 02:19:38,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126046379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:19:38,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574439405] [2024-11-28 02:19:38,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:19:38,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:19:38,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:19:38,466 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:19:38,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 02:19:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:19:38,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-28 02:19:38,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:19:41,348 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:19:41,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:19:41,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:19:41,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:19:42,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:19:42,719 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 68 treesize of output 40 [2024-11-28 02:19:42,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:19:43,185 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:19:43,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:19:43,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:19:43,644 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:19:43,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:19:43,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:19:44,138 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:19:44,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:19:44,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:19:44,682 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:19:44,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:19:44,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:19:45,263 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:19:45,264 INFO L378 Elim1Store]: Elim1 eliminated variable 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 70 treesize of output 65 [2024-11-28 02:19:45,280 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 49 treesize of output 30 [2024-11-28 02:19:45,980 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 18 [2024-11-28 02:19:45,996 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 23 treesize of output 11 [2024-11-28 02:19:47,220 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 39 treesize of output 21 [2024-11-28 02:19:47,243 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 32 treesize of output 14 [2024-11-28 02:19:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:19:47,485 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:19:47,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574439405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:19:47,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:19:47,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [4] total 21 [2024-11-28 02:19:47,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201381287] [2024-11-28 02:19:47,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:19:47,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 02:19:47,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:19:47,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 02:19:47,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-11-28 02:19:47,487 INFO L87 Difference]: Start difference. First operand 893 states and 1079 transitions. Second operand has 19 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 19 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:20:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:20:09,227 INFO L93 Difference]: Finished difference Result 922 states and 1109 transitions. [2024-11-28 02:20:09,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 02:20:09,228 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 19 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 124 [2024-11-28 02:20:09,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:20:09,231 INFO L225 Difference]: With dead ends: 922 [2024-11-28 02:20:09,231 INFO L226 Difference]: Without dead ends: 922 [2024-11-28 02:20:09,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2024-11-28 02:20:09,231 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 1016 mSDsluCounter, 2665 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 2986 SdHoareTripleChecker+Invalid, 2651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:20:09,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 2986 Invalid, 2651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 19.0s Time] [2024-11-28 02:20:09,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-28 02:20:09,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 900. [2024-11-28 02:20:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 749 states have (on average 1.4325767690253672) internal successors, (1073), 891 states have internal predecessors, (1073), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-28 02:20:09,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1085 transitions. [2024-11-28 02:20:09,246 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1085 transitions. Word has length 124 [2024-11-28 02:20:09,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:20:09,247 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1085 transitions. [2024-11-28 02:20:09,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 19 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 02:20:09,247 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1085 transitions. [2024-11-28 02:20:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-28 02:20:09,248 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:20:09,248 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:20:09,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-28 02:20:09,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2024-11-28 02:20:09,449 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:20:09,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:20:09,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1026026702, now seen corresponding path program 1 times [2024-11-28 02:20:09,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:20:09,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017326229] [2024-11-28 02:20:09,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:20:09,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:20:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:20:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:20:10,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:20:10,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017326229] [2024-11-28 02:20:10,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017326229] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:20:10,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376425642] [2024-11-28 02:20:10,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:20:10,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:20:10,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:20:10,069 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:20:10,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-28 02:20:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:20:10,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-28 02:20:10,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:20:11,644 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:20:11,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:20:11,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:20:12,534 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:20:12,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:20:12,841 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:20:12,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:20:13,156 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:20:13,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:20:13,476 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:20:13,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:20:13,806 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:20:13,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:20:14,187 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:20:14,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:20:14,830 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:20:14,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:20:15,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 02:20:15,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:20:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:20:16,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:20:17,340 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5068 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_5068) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-28 02:20:17,374 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5068 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5068) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 02:20:17,462 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-28 02:20:17,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-28 02:20:17,492 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_5067))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5068)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem57#1.base|)) is different from false [2024-11-28 02:20:17,949 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_5066)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_5067))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5068)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) is different from false [2024-11-28 02:20:17,993 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5066))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_5067))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5068)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-28 02:20:18,069 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5065 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_5065))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5066)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_5067))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5068)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-28 02:20:18,130 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5065 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5065))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5066)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_5067))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5068)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-28 02:20:18,266 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5065 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int)) (v_ArrVal_5064 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_5064))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5065)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5066)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_5067))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5068)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-28 02:20:18,382 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5065 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int)) (v_ArrVal_5064 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5064))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5065)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5066)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_5067))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5068)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-28 02:20:18,732 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5065 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int)) (v_ArrVal_5064 (Array Int Int)) (v_ArrVal_5063 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5063))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5064)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5065)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5066)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_5067))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5068)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-28 02:20:19,063 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5065 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int)) (v_ArrVal_5064 (Array Int Int)) (v_ArrVal_5063 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5063))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5064)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5065)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5066)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_5067))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5068)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 02:20:20,310 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5065 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int)) (v_ArrVal_5071 (Array Int Int)) (v_ArrVal_5064 (Array Int Int)) (v_ArrVal_5063 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_5071))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5063)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5064)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5065)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5066)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_5067))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5068)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-28 02:20:20,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376425642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:20:20,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:20:20,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 18] total 22 [2024-11-28 02:20:20,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500520297] [2024-11-28 02:20:20,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:20:20,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 02:20:20,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:20:20,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 02:20:20,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=582, Unknown=14, NotChecked=708, Total=1406 [2024-11-28 02:20:20,320 INFO L87 Difference]: Start difference. First operand 900 states and 1085 transitions. Second operand has 22 states, 21 states have (on average 10.857142857142858) internal successors, (228), 22 states have internal predecessors, (228), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:20:41,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:20:41,434 INFO L93 Difference]: Finished difference Result 874 states and 1056 transitions. [2024-11-28 02:20:41,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 02:20:41,434 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 10.857142857142858) internal successors, (228), 22 states have internal predecessors, (228), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 125 [2024-11-28 02:20:41,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:20:41,437 INFO L225 Difference]: With dead ends: 874 [2024-11-28 02:20:41,437 INFO L226 Difference]: Without dead ends: 870 [2024-11-28 02:20:41,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=248, Invalid=1678, Unknown=14, NotChecked=1140, Total=3080 [2024-11-28 02:20:41,438 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 503 mSDsluCounter, 3072 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 3389 SdHoareTripleChecker+Invalid, 2601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:20:41,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 3389 Invalid, 2601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2575 Invalid, 0 Unknown, 0 Unchecked, 18.1s Time] [2024-11-28 02:20:41,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-28 02:20:41,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 866. [2024-11-28 02:20:41,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 718 states have (on average 1.4498607242339834) internal successors, (1041), 859 states have internal predecessors, (1041), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 02:20:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1049 transitions. [2024-11-28 02:20:41,452 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1049 transitions. Word has length 125 [2024-11-28 02:20:41,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:20:41,452 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1049 transitions. [2024-11-28 02:20:41,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 10.857142857142858) internal successors, (228), 22 states have internal predecessors, (228), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:20:41,452 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1049 transitions. [2024-11-28 02:20:41,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-28 02:20:41,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:20:41,453 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:20:41,467 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-28 02:20:41,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2024-11-28 02:20:41,654 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr138REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:20:41,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:20:41,655 INFO L85 PathProgramCache]: Analyzing trace with hash 84896648, now seen corresponding path program 1 times [2024-11-28 02:20:41,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:20:41,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193513056] [2024-11-28 02:20:41,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:20:41,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:20:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:20:42,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:20:42,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:20:42,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193513056] [2024-11-28 02:20:42,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193513056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:20:42,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011726874] [2024-11-28 02:20:42,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:20:42,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:20:42,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:20:42,401 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:20:42,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-28 02:20:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:20:43,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-28 02:20:43,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:20:45,409 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:20:45,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:20:45,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:20:45,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:20:46,868 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:20:46,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:20:46,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:20:47,348 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:20:47,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:20:47,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:20:47,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:20:47,827 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 68 treesize of output 40 [2024-11-28 02:20:47,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:20:48,317 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:20:48,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:20:48,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:20:48,834 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:20:48,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:20:48,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:20:49,462 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:20:49,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:20:49,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:20:50,040 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:20:50,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:20:50,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:20:50,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 02:20:50,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:20:52,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:20:52,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 02:20:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:20:52,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:20:54,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:20:54,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 48 treesize of output 52 [2024-11-28 02:20:54,796 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_5294 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem59#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_prenex_89 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem59#1.offset| 29))) (forall ((v_ArrVal_5293 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_5293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12))))) is different from false [2024-11-28 02:20:54,870 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_prenex_89 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 29))) (forall ((v_ArrVal_5293 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12))) (forall ((v_ArrVal_5294 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 02:20:54,993 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_5292))) (< (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 29)))) (forall ((v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_5292) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_5291))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse2 (select (select (store .cse3 .cse2 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-28 02:20:55,121 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5292) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12))) (forall ((v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5292))) (< (select (select (store .cse2 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 29)))) (forall ((v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5291))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse3 (select (select (store .cse4 .cse3 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-28 02:20:55,272 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_5289))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5291)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_5289))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_5290) .cse6 v_ArrVal_5292))) (< (select (select (store .cse4 (select (select (store .cse5 .cse6 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ 29 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) (forall ((v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ 12 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_5289))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_5290) .cse7 v_ArrVal_5292) (select (select (store .cse8 .cse7 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5293))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 02:20:55,381 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_5289))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_5290) .cse2 v_ArrVal_5292))) (< (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ 29 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) (forall ((v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_5289))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_5290) .cse5 v_ArrVal_5292) (select (select (store .cse6 .cse5 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5293))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 12))) (forall ((v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_5289))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5291)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse7 (select (select (store .cse8 .cse7 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) is different from false [2024-11-28 02:20:55,737 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_5288))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_5289))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_5287) .cse0 v_ArrVal_5290) .cse1 v_ArrVal_5292) (select (select (store .cse2 .cse1 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5293))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 12))) (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_5288))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse9 .cse8 v_ArrVal_5289))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_5287) .cse8 v_ArrVal_5290) .cse7 v_ArrVal_5292))) (< (select (select (store .cse5 (select (select (store .cse6 .cse7 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 29)))))))) (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse10 (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_5288))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5289)))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5291)))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (store .cse10 .cse11 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse11)))))) is different from false [2024-11-28 02:20:55,974 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_5288))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse6 .cse5 v_ArrVal_5289))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_5287) .cse5 v_ArrVal_5290) .cse2 v_ArrVal_5292))) (< (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 29)))))))) (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_5288))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_5289))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_5287) .cse7 v_ArrVal_5290) .cse8 v_ArrVal_5292) (select (select (store .cse9 .cse8 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5293))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 12))) (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_5288))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5289)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5291)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (store .cse11 .cse12 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse12))))))) is different from false [2024-11-28 02:20:56,419 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_main_#t~mem54#1.offset|))) (and (forall ((v_ArrVal_5286 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_5286 .cse1)) v_ArrVal_5286)) (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_5286))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_5288))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_5289))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_5285) .cse2 v_ArrVal_5287) .cse3 v_ArrVal_5290) .cse4 v_ArrVal_5292) (select (select (store .cse5 .cse4 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_5293))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 12))))) (forall ((v_ArrVal_5286 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_5286 .cse1)) v_ArrVal_5286)) (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_5286))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_5288))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse10 (store .cse14 .cse13 v_ArrVal_5289))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse9 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_5285) .cse12 v_ArrVal_5287) .cse13 v_ArrVal_5290) .cse11 v_ArrVal_5292))) (< (select (select (store .cse9 (select (select (store .cse10 .cse11 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (+ 29 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))))))) (forall ((v_ArrVal_5286 (Array Int Int))) (or (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse17 (let ((.cse18 (let ((.cse19 (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_5286))) (store .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_5288)))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_5289)))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_5291)))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (= .cse16 (select (select (store .cse17 .cse16 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))) (not (= (store .cse0 .cse1 (select v_ArrVal_5286 .cse1)) v_ArrVal_5286)))))) is different from false [2024-11-28 02:20:56,651 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse0 (select |c_#memory_$Pointer$#1.base| .cse2))) (and (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int)) (or (forall ((v_ArrVal_5286 (Array Int Int))) (or (not (= v_ArrVal_5286 (let ((.cse1 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store .cse0 .cse1 (select v_ArrVal_5286 .cse1))))) (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ 12 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_5286))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_5288))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse6 (store .cse8 .cse4 v_ArrVal_5289))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_5285) .cse3 v_ArrVal_5287) .cse4 v_ArrVal_5290) .cse5 v_ArrVal_5292) (select (select (store .cse6 .cse5 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) v_ArrVal_5293))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)))))) (< .cse10 |v_ULTIMATE.start_main_#t~mem54#1.offset_35|))) (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int)) (or (< .cse10 |v_ULTIMATE.start_main_#t~mem54#1.offset_35|) (forall ((v_ArrVal_5286 (Array Int Int))) (or (not (= v_ArrVal_5286 (let ((.cse11 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store .cse0 .cse11 (select v_ArrVal_5286 .cse11))))) (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse13 (let ((.cse14 (let ((.cse15 (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_5286))) (store .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) v_ArrVal_5288)))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) v_ArrVal_5289)))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) v_ArrVal_5291)))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (= .cse12 (select (select (store .cse13 .cse12 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int)) (or (< .cse10 |v_ULTIMATE.start_main_#t~mem54#1.offset_35|) (forall ((v_ArrVal_5286 (Array Int Int))) (or (not (= v_ArrVal_5286 (let ((.cse17 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store .cse0 .cse17 (select v_ArrVal_5286 .cse17))))) (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_5286))) (let ((.cse21 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse23 (store .cse24 .cse21 v_ArrVal_5288))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse19 (store .cse23 .cse22 v_ArrVal_5289))) (let ((.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse18 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_5285) .cse21 v_ArrVal_5287) .cse22 v_ArrVal_5290) .cse20 v_ArrVal_5292))) (< (select (select (store .cse18 (select (select (store .cse19 .cse20 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) (+ (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) 29)))))))))))))))))) is different from false [2024-11-28 02:20:58,069 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5284))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|) (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5283))) (let ((.cse2 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ 12 (select (select (let ((.cse8 (store .cse9 .cse2 v_ArrVal_5286))) (let ((.cse3 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse8 .cse3 v_ArrVal_5288))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_5289))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store (store .cse0 .cse2 v_ArrVal_5285) .cse3 v_ArrVal_5287) .cse4 v_ArrVal_5290) .cse5 v_ArrVal_5292) (select (select (store .cse6 .cse5 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5293))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= (let ((.cse10 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse9 .cse2) .cse10 (select v_ArrVal_5286 .cse10))) v_ArrVal_5286))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5284))) (or (< (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|) (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5283))) (let ((.cse15 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse19 (store .cse20 .cse15 v_ArrVal_5286))) (let ((.cse16 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse18 (store .cse19 .cse16 v_ArrVal_5288))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse18 .cse17 v_ArrVal_5289))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store (store (store (store .cse11 .cse15 v_ArrVal_5285) .cse16 v_ArrVal_5287) .cse17 v_ArrVal_5290) .cse14 v_ArrVal_5292))) (< (select (select (store .cse12 (select (select (store .cse13 .cse14 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 29)))))))))) (not (= (let ((.cse21 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse20 .cse15) .cse21 (select v_ArrVal_5286 .cse21))) v_ArrVal_5286))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (or (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5283))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse23 (let ((.cse24 (let ((.cse25 (let ((.cse26 (store .cse27 .cse28 v_ArrVal_5286))) (store .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5288)))) (store .cse25 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5289)))) (store .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5291)))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse22 (select (select (store .cse23 .cse22 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (not (= (let ((.cse29 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse27 .cse28) .cse29 (select v_ArrVal_5286 .cse29))) v_ArrVal_5286)))))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|))))) is different from false [2024-11-28 02:20:59,280 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_5284))) (or (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_5283))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_5286))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_5288))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse8 .cse7 v_ArrVal_5289))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store (store .cse4 .cse5 v_ArrVal_5285) .cse6 v_ArrVal_5287) .cse7 v_ArrVal_5290) .cse2 v_ArrVal_5292))) (< (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ 29 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) (not (= (let ((.cse11 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse10 .cse5) .cse11 (select v_ArrVal_5286 .cse11))) v_ArrVal_5286)))))) (< (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|)))) (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (or (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_5283))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (not (= (let ((.cse15 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse13 .cse14) .cse15 (select v_ArrVal_5286 .cse15))) v_ArrVal_5286)) (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse16 (let ((.cse18 (let ((.cse19 (let ((.cse20 (store .cse13 .cse14 v_ArrVal_5286))) (store .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5288)))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5289)))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5291)))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (store .cse16 .cse17 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse17)))))))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_5284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|))) (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_5284))) (or (< (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|) (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_5283))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (not (= (let ((.cse24 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse22 .cse23) .cse24 (select v_ArrVal_5286 .cse24))) v_ArrVal_5286)) (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse30 (store .cse22 .cse23 v_ArrVal_5286))) (let ((.cse25 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse29 (store .cse30 .cse25 v_ArrVal_5288))) (let ((.cse26 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse28 (store .cse29 .cse26 v_ArrVal_5289))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store (store .cse21 .cse23 v_ArrVal_5285) .cse25 v_ArrVal_5287) .cse26 v_ArrVal_5290) .cse27 v_ArrVal_5292) (select (select (store .cse28 .cse27 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5293))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 12))))))))))))) is different from false [2024-11-28 02:21:00,052 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_5301 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5302 (Array Int Int)) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_5302))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_5301) .cse13 v_ArrVal_5284))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|) (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse10 (store .cse12 .cse13 v_ArrVal_5283))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_5286))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_5288))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse3 (store .cse8 .cse7 v_ArrVal_5289))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store (store (store (store .cse0 .cse5 v_ArrVal_5285) .cse6 v_ArrVal_5287) .cse7 v_ArrVal_5290) .cse4 v_ArrVal_5292))) (< (select (select (store .cse2 (select (select (store .cse3 .cse4 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ 29 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (not (= v_ArrVal_5286 (let ((.cse11 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse10 .cse5) .cse11 (select v_ArrVal_5286 .cse11)))))))))))))) (forall ((v_ArrVal_5301 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5302 (Array Int Int)) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_5302))) (let ((.cse14 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_5301) .cse14 v_ArrVal_5284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|) (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse15 (store .cse23 .cse14 v_ArrVal_5283))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= v_ArrVal_5286 (let ((.cse17 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse15 .cse16) .cse17 (select v_ArrVal_5286 .cse17))))) (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse18 (let ((.cse20 (let ((.cse21 (let ((.cse22 (store .cse15 .cse16 v_ArrVal_5286))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5288)))) (store .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5289)))) (store .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5291)))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (store .cse18 .cse19 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse19)))))))))))) (forall ((v_ArrVal_5301 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5302 (Array Int Int)) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_5302))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse27 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_5301) .cse35 v_ArrVal_5284))) (or (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse24 (store .cse34 .cse35 v_ArrVal_5283))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= v_ArrVal_5286 (let ((.cse26 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse24 .cse25) .cse26 (select v_ArrVal_5286 .cse26))))) (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse33 (store .cse24 .cse25 v_ArrVal_5286))) (let ((.cse28 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse32 (store .cse33 .cse28 v_ArrVal_5288))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store .cse32 .cse29 v_ArrVal_5289))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store (store .cse27 .cse25 v_ArrVal_5285) .cse28 v_ArrVal_5287) .cse29 v_ArrVal_5290) .cse30 v_ArrVal_5292) (select (select (store .cse31 .cse30 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5293))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12))))))) (< (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|)))))))) is different from false [2024-11-28 02:21:00,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011726874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:21:00,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:21:00,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19] total 24 [2024-11-28 02:21:00,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499444823] [2024-11-28 02:21:00,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:21:00,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 02:21:00,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:21:00,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 02:21:00,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=684, Unknown=13, NotChecked=832, Total=1640 [2024-11-28 02:21:00,074 INFO L87 Difference]: Start difference. First operand 866 states and 1049 transitions. Second operand has 24 states, 23 states have (on average 10.434782608695652) internal successors, (240), 24 states have internal predecessors, (240), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:21:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:21:20,641 INFO L93 Difference]: Finished difference Result 876 states and 1058 transitions. [2024-11-28 02:21:20,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-28 02:21:20,642 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 10.434782608695652) internal successors, (240), 24 states have internal predecessors, (240), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 126 [2024-11-28 02:21:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:21:20,644 INFO L225 Difference]: With dead ends: 876 [2024-11-28 02:21:20,644 INFO L226 Difference]: Without dead ends: 874 [2024-11-28 02:21:20,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=289, Invalid=2102, Unknown=13, NotChecked=1378, Total=3782 [2024-11-28 02:21:20,645 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 888 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 2276 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 2714 SdHoareTripleChecker+Invalid, 2297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:21:20,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 2714 Invalid, 2297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2276 Invalid, 0 Unknown, 0 Unchecked, 16.3s Time] [2024-11-28 02:21:20,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-28 02:21:20,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-28 02:21:20,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 725 states have (on average 1.4455172413793103) internal successors, (1048), 866 states have internal predecessors, (1048), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 02:21:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1056 transitions. [2024-11-28 02:21:20,661 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1056 transitions. Word has length 126 [2024-11-28 02:21:20,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:21:20,662 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1056 transitions. [2024-11-28 02:21:20,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 10.434782608695652) internal successors, (240), 24 states have internal predecessors, (240), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:21:20,662 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1056 transitions. [2024-11-28 02:21:20,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-28 02:21:20,663 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:21:20,663 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:21:20,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-28 02:21:20,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:21:20,867 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:21:20,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:21:20,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1224414959, now seen corresponding path program 2 times [2024-11-28 02:21:20,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:21:20,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290409348] [2024-11-28 02:21:20,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:21:20,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:21:20,911 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 02:21:20,911 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:21:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-28 02:21:21,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:21:21,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290409348] [2024-11-28 02:21:21,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290409348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:21:21,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:21:21,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:21:21,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93777085] [2024-11-28 02:21:21,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:21:21,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:21:21,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:21:21,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:21:21,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:21:21,765 INFO L87 Difference]: Start difference. First operand 874 states and 1056 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:21:24,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:21:24,443 INFO L93 Difference]: Finished difference Result 894 states and 1080 transitions. [2024-11-28 02:21:24,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:21:24,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 128 [2024-11-28 02:21:24,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:21:24,445 INFO L225 Difference]: With dead ends: 894 [2024-11-28 02:21:24,445 INFO L226 Difference]: Without dead ends: 894 [2024-11-28 02:21:24,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:21:24,445 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 9 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:21:24,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2254 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-28 02:21:24,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-11-28 02:21:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 882. [2024-11-28 02:21:24,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 733 states have (on average 1.4351978171896316) internal successors, (1052), 874 states have internal predecessors, (1052), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 02:21:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1060 transitions. [2024-11-28 02:21:24,460 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1060 transitions. Word has length 128 [2024-11-28 02:21:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:21:24,460 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1060 transitions. [2024-11-28 02:21:24,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:21:24,460 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1060 transitions. [2024-11-28 02:21:24,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-28 02:21:24,461 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:21:24,461 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:21:24,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-28 02:21:24,462 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:21:24,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:21:24,462 INFO L85 PathProgramCache]: Analyzing trace with hash -276010185, now seen corresponding path program 1 times [2024-11-28 02:21:24,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:21:24,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29661120] [2024-11-28 02:21:24,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:21:24,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:21:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:21:25,165 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-28 02:21:25,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:21:25,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29661120] [2024-11-28 02:21:25,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29661120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:21:25,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:21:25,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:21:25,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892127736] [2024-11-28 02:21:25,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:21:25,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:21:25,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:21:25,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:21:25,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:21:25,167 INFO L87 Difference]: Start difference. First operand 882 states and 1060 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:21:28,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:21:28,070 INFO L93 Difference]: Finished difference Result 902 states and 1084 transitions. [2024-11-28 02:21:28,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:21:28,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 129 [2024-11-28 02:21:28,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:21:28,072 INFO L225 Difference]: With dead ends: 902 [2024-11-28 02:21:28,072 INFO L226 Difference]: Without dead ends: 902 [2024-11-28 02:21:28,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:21:28,072 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 10 mSDsluCounter, 2201 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2706 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:21:28,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2706 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-28 02:21:28,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-11-28 02:21:28,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 898. [2024-11-28 02:21:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 749 states have (on average 1.431241655540721) internal successors, (1072), 890 states have internal predecessors, (1072), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 02:21:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1080 transitions. [2024-11-28 02:21:28,081 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1080 transitions. Word has length 129 [2024-11-28 02:21:28,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:21:28,082 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1080 transitions. [2024-11-28 02:21:28,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:21:28,082 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1080 transitions. [2024-11-28 02:21:28,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-28 02:21:28,083 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:21:28,083 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:21:28,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-28 02:21:28,083 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:21:28,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:21:28,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1619411060, now seen corresponding path program 1 times [2024-11-28 02:21:28,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:21:28,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065212322] [2024-11-28 02:21:28,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:21:28,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:21:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:21:28,825 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-28 02:21:28,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:21:28,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065212322] [2024-11-28 02:21:28,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065212322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:21:28,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:21:28,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:21:28,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251823995] [2024-11-28 02:21:28,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:21:28,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:21:28,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:21:28,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:21:28,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:21:28,828 INFO L87 Difference]: Start difference. First operand 898 states and 1080 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:21:30,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:21:30,785 INFO L93 Difference]: Finished difference Result 910 states and 1092 transitions. [2024-11-28 02:21:30,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:21:30,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 130 [2024-11-28 02:21:30,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:21:30,789 INFO L225 Difference]: With dead ends: 910 [2024-11-28 02:21:30,790 INFO L226 Difference]: Without dead ends: 910 [2024-11-28 02:21:30,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:21:30,790 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 4 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:21:30,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1861 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 02:21:30,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-11-28 02:21:30,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2024-11-28 02:21:30,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 761 states have (on average 1.4244415243101183) internal successors, (1084), 902 states have internal predecessors, (1084), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 02:21:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1092 transitions. [2024-11-28 02:21:30,799 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1092 transitions. Word has length 130 [2024-11-28 02:21:30,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:21:30,800 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1092 transitions. [2024-11-28 02:21:30,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:21:30,800 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1092 transitions. [2024-11-28 02:21:30,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-28 02:21:30,801 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:21:30,801 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:21:30,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-28 02:21:30,801 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:21:30,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:21:30,802 INFO L85 PathProgramCache]: Analyzing trace with hash 669432667, now seen corresponding path program 1 times [2024-11-28 02:21:30,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:21:30,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952308571] [2024-11-28 02:21:30,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:21:30,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:21:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:21:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-28 02:21:32,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:21:32,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952308571] [2024-11-28 02:21:32,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952308571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:21:32,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:21:32,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 02:21:32,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780603793] [2024-11-28 02:21:32,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:21:32,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:21:32,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:21:32,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:21:32,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:21:32,321 INFO L87 Difference]: Start difference. First operand 910 states and 1092 transitions. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:21:36,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:21:36,656 INFO L93 Difference]: Finished difference Result 962 states and 1164 transitions. [2024-11-28 02:21:36,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:21:36,656 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 130 [2024-11-28 02:21:36,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:21:36,658 INFO L225 Difference]: With dead ends: 962 [2024-11-28 02:21:36,659 INFO L226 Difference]: Without dead ends: 962 [2024-11-28 02:21:36,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-28 02:21:36,659 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 30 mSDsluCounter, 3151 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3657 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:21:36,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3657 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-28 02:21:36,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-11-28 02:21:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 950. [2024-11-28 02:21:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 801 states have (on average 1.4232209737827715) internal successors, (1140), 942 states have internal predecessors, (1140), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 02:21:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1148 transitions. [2024-11-28 02:21:36,673 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1148 transitions. Word has length 130 [2024-11-28 02:21:36,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:21:36,673 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1148 transitions. [2024-11-28 02:21:36,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:21:36,673 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1148 transitions. [2024-11-28 02:21:36,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-28 02:21:36,674 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:21:36,675 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:21:36,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-28 02:21:36,675 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:21:36,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:21:36,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1056049972, now seen corresponding path program 1 times [2024-11-28 02:21:36,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:21:36,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582149001] [2024-11-28 02:21:36,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:21:36,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:21:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:21:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:21:37,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:21:37,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582149001] [2024-11-28 02:21:37,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582149001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:21:37,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158100747] [2024-11-28 02:21:37,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:21:37,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:21:37,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:21:37,587 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:21:37,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-28 02:21:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:21:38,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-28 02:21:38,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:21:38,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 02:21:41,809 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 02:21:41,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 02:21:41,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 02:21:42,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:21:42,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 19 treesize of output 1 [2024-11-28 02:21:42,679 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 7 [2024-11-28 02:21:42,962 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 10 treesize of output 4 [2024-11-28 02:21:43,876 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset#1_#t~loopctr160_83| Int) (|v_#Ultimate.C_memset#1_#t~loopctr160_82| Int)) (and (<= |v_#Ultimate.C_memset#1_#t~loopctr160_83| (+ |v_#Ultimate.C_memset#1_#t~loopctr160_82| 1)) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_82| 0) (<= |c_#Ultimate.C_memset#1_#t~loopctr160| (+ |v_#Ultimate.C_memset#1_#t~loopctr160_83| 1)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base| (store (store (select |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base|) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_82| |c_#Ultimate.C_memset#1_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_83| |c_#Ultimate.C_memset#1_#ptr.offset|) 0))))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26|) 1) (<= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26|) 40)))) is different from true [2024-11-28 02:21:44,047 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset#1_#t~loopctr160_83| Int) (|v_#Ultimate.C_memset#1_#t~loopctr160_84| Int) (|v_#Ultimate.C_memset#1_#t~loopctr160_82| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base| (store (store (store (select |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base|) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_82| |c_#Ultimate.C_memset#1_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_83| |c_#Ultimate.C_memset#1_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_84| |c_#Ultimate.C_memset#1_#ptr.offset|) 0))) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_83| (+ |v_#Ultimate.C_memset#1_#t~loopctr160_82| 1)) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_82| 0) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_84| (+ |v_#Ultimate.C_memset#1_#t~loopctr160_83| 1)))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26|) 1) (<= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26|) 40)))) is different from true [2024-11-28 02:21:44,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:21:44,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:21:44,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:21:44,728 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2024-11-28 02:21:44,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 44 [2024-11-28 02:21:46,381 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 02:21:46,381 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 2 case distinctions, treesize of input 87 treesize of output 62 [2024-11-28 02:21:47,415 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:21:47,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:21:48,227 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:21:48,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:21:48,996 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:21:48,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:21:50,013 INFO L349 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2024-11-28 02:21:50,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 31 [2024-11-28 02:21:50,051 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 02:21:50,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2024-11-28 02:21:50,531 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:21:50,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:21:51,534 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:21:51,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 02:21:52,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-28 02:21:52,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 02:21:54,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:21:54,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-28 02:21:55,118 INFO L349 Elim1Store]: treesize reduction 12, result has 75.5 percent of original size [2024-11-28 02:21:55,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 49 [2024-11-28 02:21:56,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:21:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-11-28 02:21:56,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:21:58,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158100747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:21:58,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:21:58,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 30] total 36 [2024-11-28 02:21:58,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573195053] [2024-11-28 02:21:58,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:21:58,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-28 02:21:58,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:21:58,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-28 02:21:58,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1252, Unknown=3, NotChecked=146, Total=1560 [2024-11-28 02:21:58,037 INFO L87 Difference]: Start difference. First operand 950 states and 1148 transitions. Second operand has 36 states, 35 states have (on average 7.085714285714285) internal successors, (248), 35 states have internal predecessors, (248), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:22:05,097 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_#Ultimate.C_memset#1_#amount| 44)) (exists ((|v_#Ultimate.C_memset#1_#t~loopctr160_83| Int) (|v_#Ultimate.C_memset#1_#t~loopctr160_84| Int) (|v_#Ultimate.C_memset#1_#t~loopctr160_82| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base| (store (store (store (select |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base|) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_82| |c_#Ultimate.C_memset#1_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_83| |c_#Ultimate.C_memset#1_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_84| |c_#Ultimate.C_memset#1_#ptr.offset|) 0))) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_83| (+ |v_#Ultimate.C_memset#1_#t~loopctr160_82| 1)) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_82| 0) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_84| (+ |v_#Ultimate.C_memset#1_#t~loopctr160_83| 1)))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26|) 1) (<= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26|) 40)))) is different from true [2024-11-28 02:22:53,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:22:53,372 INFO L93 Difference]: Finished difference Result 958 states and 1160 transitions. [2024-11-28 02:22:53,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 02:22:53,373 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 7.085714285714285) internal successors, (248), 35 states have internal predecessors, (248), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 130 [2024-11-28 02:22:53,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:22:53,375 INFO L225 Difference]: With dead ends: 958 [2024-11-28 02:22:53,375 INFO L226 Difference]: Without dead ends: 956 [2024-11-28 02:22:53,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=238, Invalid=2122, Unknown=4, NotChecked=288, Total=2652 [2024-11-28 02:22:53,375 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 873 mSDsluCounter, 4794 mSDsCounter, 0 mSdLazyCounter, 6357 mSolverCounterSat, 19 mSolverCounterUnsat, 67 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 5043 SdHoareTripleChecker+Invalid, 7696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 6357 IncrementalHoareTripleChecker+Invalid, 67 IncrementalHoareTripleChecker+Unknown, 1253 IncrementalHoareTripleChecker+Unchecked, 52.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:22:53,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 5043 Invalid, 7696 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 6357 Invalid, 67 Unknown, 1253 Unchecked, 52.4s Time] [2024-11-28 02:22:53,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-11-28 02:22:53,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 951. [2024-11-28 02:22:53,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 802 states have (on average 1.4226932668329177) internal successors, (1141), 943 states have internal predecessors, (1141), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 02:22:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1149 transitions. [2024-11-28 02:22:53,384 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1149 transitions. Word has length 130 [2024-11-28 02:22:53,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:22:53,385 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1149 transitions. [2024-11-28 02:22:53,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 7.085714285714285) internal successors, (248), 35 states have internal predecessors, (248), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:22:53,385 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1149 transitions. [2024-11-28 02:22:53,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-28 02:22:53,385 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:22:53,385 INFO L218 NwaCegarLoop]: trace histogram [5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:22:53,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-28 02:22:53,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:22:53,586 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:22:53,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:22:53,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1200425259, now seen corresponding path program 2 times [2024-11-28 02:22:53,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:22:53,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225280873] [2024-11-28 02:22:53,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:22:53,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:22:53,638 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 02:22:53,638 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:22:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-28 02:22:54,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:22:54,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225280873] [2024-11-28 02:22:54,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225280873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:22:54,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:22:54,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 02:22:54,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229819274] [2024-11-28 02:22:54,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:22:54,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 02:22:54,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:22:54,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 02:22:54,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:22:54,906 INFO L87 Difference]: Start difference. First operand 951 states and 1149 transitions. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:22:58,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:22:58,345 INFO L93 Difference]: Finished difference Result 963 states and 1161 transitions. [2024-11-28 02:22:58,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:22:58,345 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 131 [2024-11-28 02:22:58,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:22:58,347 INFO L225 Difference]: With dead ends: 963 [2024-11-28 02:22:58,347 INFO L226 Difference]: Without dead ends: 963 [2024-11-28 02:22:58,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:22:58,348 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 23 mSDsluCounter, 2692 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3202 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:22:58,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3202 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-28 02:22:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-28 02:22:58,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2024-11-28 02:22:58,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 814 states have (on average 1.4164619164619165) internal successors, (1153), 955 states have internal predecessors, (1153), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-28 02:22:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1161 transitions. [2024-11-28 02:22:58,360 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1161 transitions. Word has length 131 [2024-11-28 02:22:58,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:22:58,361 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1161 transitions. [2024-11-28 02:22:58,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 02:22:58,361 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1161 transitions. [2024-11-28 02:22:58,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-28 02:22:58,362 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:22:58,362 INFO L218 NwaCegarLoop]: trace histogram [5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:22:58,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-11-28 02:22:58,362 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-28 02:22:58,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:22:58,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1241471141, now seen corresponding path program 1 times [2024-11-28 02:22:58,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:22:58,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910118941] [2024-11-28 02:22:58,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:22:58,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:22:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:22:59,714 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:22:59,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:22:59,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910118941] [2024-11-28 02:22:59,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910118941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:22:59,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113223481] [2024-11-28 02:22:59,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:22:59,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:22:59,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:22:59,717 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:22:59,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14099936-adf0-4ad7-b8e1-76f0f1791bbd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-28 02:23:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:23:00,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-28 02:23:00,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:23:01,596 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:23:01,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:23:01,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:23:02,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-28 02:23:03,134 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:23:03,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:23:03,748 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:23:03,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:23:03,765 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 20 treesize of output 1 [2024-11-28 02:23:04,231 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:23:04,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:23:04,249 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 20 treesize of output 1 [2024-11-28 02:23:04,714 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:23:04,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:23:04,731 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 20 treesize of output 1 [2024-11-28 02:23:05,200 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:23:05,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:23:05,217 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 20 treesize of output 1 [2024-11-28 02:23:05,717 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:23:05,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 02:23:06,105 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-28 02:23:06,105 INFO L378 Elim1Store]: Elim1 eliminated variable 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 107 treesize of output 67 [2024-11-28 02:23:06,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2024-11-28 02:23:06,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:23:06,964 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-28 02:23:06,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 62 [2024-11-28 02:23:06,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2024-11-28 02:23:07,216 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 18 [2024-11-28 02:23:07,969 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-28 02:23:07,969 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 36 treesize of output 17 [2024-11-28 02:23:08,499 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-28 02:23:08,500 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 64 treesize of output 59 [2024-11-28 02:23:08,517 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 14 [2024-11-28 02:23:09,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:23:09,769 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-28 02:23:09,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:23:11,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113223481] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:23:11,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:23:11,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 21] total 28 [2024-11-28 02:23:11,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87515564] [2024-11-28 02:23:11,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:23:11,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-28 02:23:11,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:23:11,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-28 02:23:11,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=885, Unknown=15, NotChecked=0, Total=992 [2024-11-28 02:23:11,540 INFO L87 Difference]: Start difference. First operand 963 states and 1161 transitions. Second operand has 28 states, 26 states have (on average 9.038461538461538) internal successors, (235), 28 states have internal predecessors, (235), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4)