./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1 --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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 08:25:04,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 08:25:04,676 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-12-02 08:25:04,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 08:25:04,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 08:25:04,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 08:25:04,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 08:25:04,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 08:25:04,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 08:25:04,701 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 08:25:04,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 08:25:04,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 08:25:04,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 08:25:04,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 08:25:04,701 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 08:25:04,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 08:25:04,702 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 08:25:04,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 08:25:04,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 08:25:04,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 08:25:04,702 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 08:25:04,702 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 08:25:04,702 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 08:25:04,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 08:25:04,702 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 08:25:04,702 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 08:25:04,702 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 08:25:04,702 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 08:25:04,702 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 08:25:04,703 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 08:25:04,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 08:25:04,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 08:25:04,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 08:25:04,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 08:25:04,703 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 08:25:04,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 08:25:04,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 08:25:04,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 08:25:04,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 08:25:04,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 08:25:04,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 08:25:04,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 08:25:04,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 08:25:04,704 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 08:25:04,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 08:25:04,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 08:25:04,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 08:25:04,704 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_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1 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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-12-02 08:25:04,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 08:25:04,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 08:25:04,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 08:25:04,942 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 08:25:04,942 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 08:25:04,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i [2024-12-02 08:25:07,540 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/data/8fb16401a/a5001b5c17cb443cac5915ffff2cc3bb/FLAG04e1494cb [2024-12-02 08:25:07,795 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 08:25:07,795 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i [2024-12-02 08:25:07,810 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/data/8fb16401a/a5001b5c17cb443cac5915ffff2cc3bb/FLAG04e1494cb [2024-12-02 08:25:08,094 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/data/8fb16401a/a5001b5c17cb443cac5915ffff2cc3bb [2024-12-02 08:25:08,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 08:25:08,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 08:25:08,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 08:25:08,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 08:25:08,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 08:25:08,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:25:08" (1/1) ... [2024-12-02 08:25:08,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e9a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:08, skipping insertion in model container [2024-12-02 08:25:08,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:25:08" (1/1) ... [2024-12-02 08:25:08,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 08:25:08,404 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 08:25:08,434 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 08:25:08,438 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 08:25:08,442 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 08:25:08,448 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 08:25:08,473 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 08:25:08,473 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 08:25:08,476 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 08:25:08,476 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 08:25:08,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 08:25:08,493 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 08:25:08,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 08:25:08,612 INFO L204 MainTranslator]: Completed translation [2024-12-02 08:25:08,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:08 WrapperNode [2024-12-02 08:25:08,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 08:25:08,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 08:25:08,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 08:25:08,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 08:25:08,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:08" (1/1) ... [2024-12-02 08:25:08,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:08" (1/1) ... [2024-12-02 08:25:08,689 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1259 [2024-12-02 08:25:08,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 08:25:08,690 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 08:25:08,690 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 08:25:08,690 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 08:25:08,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:08" (1/1) ... [2024-12-02 08:25:08,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:08" (1/1) ... [2024-12-02 08:25:08,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:08" (1/1) ... [2024-12-02 08:25:08,747 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-12-02 08:25:08,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:08" (1/1) ... [2024-12-02 08:25:08,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:08" (1/1) ... [2024-12-02 08:25:08,777 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:08" (1/1) ... [2024-12-02 08:25:08,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:08" (1/1) ... [2024-12-02 08:25:08,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:08" (1/1) ... [2024-12-02 08:25:08,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:08" (1/1) ... [2024-12-02 08:25:08,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:08" (1/1) ... [2024-12-02 08:25:08,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 08:25:08,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 08:25:08,819 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 08:25:08,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 08:25:08,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:08" (1/1) ... [2024-12-02 08:25:08,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 08:25:08,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:25:08,843 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 08:25:08,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 08:25:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-12-02 08:25:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-12-02 08:25:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-12-02 08:25:08,863 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-12-02 08:25:08,863 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-12-02 08:25:08,863 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-12-02 08:25:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-02 08:25:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-12-02 08:25:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-12-02 08:25:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-12-02 08:25:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-02 08:25:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-12-02 08:25:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-12-02 08:25:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-12-02 08:25:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-12-02 08:25:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-12-02 08:25:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-12-02 08:25:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-02 08:25:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 08:25:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-12-02 08:25:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-12-02 08:25:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-12-02 08:25:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 08:25:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-12-02 08:25:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-12-02 08:25:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 08:25:08,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 08:25:09,031 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 08:25:09,033 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 08:25:09,034 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-12-02 08:25:09,070 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-12-02 08:25:09,087 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-12-02 08:25:11,051 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2024-12-02 08:25:11,051 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 08:25:11,093 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 08:25:11,093 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2024-12-02 08:25:11,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:25:11 BoogieIcfgContainer [2024-12-02 08:25:11,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 08:25:11,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 08:25:11,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 08:25:11,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 08:25:11,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:25:08" (1/3) ... [2024-12-02 08:25:11,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7ae57d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:25:11, skipping insertion in model container [2024-12-02 08:25:11,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:08" (2/3) ... [2024-12-02 08:25:11,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7ae57d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:25:11, skipping insertion in model container [2024-12-02 08:25:11,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:25:11" (3/3) ... [2024-12-02 08:25:11,102 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test2-1.i [2024-12-02 08:25:11,116 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 08:25:11,118 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_nondet_test2-1.i that has 4 procedures, 1064 locations, 1 initial locations, 33 loop locations, and 420 error locations. [2024-12-02 08:25:11,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 08:25:11,181 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;@5882fb4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 08:25:11,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-12-02 08:25:11,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 1054 states, 632 states have (on average 2.0126582278481013) internal successors, (1272), 1049 states have internal predecessors, (1272), 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-12-02 08:25:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-02 08:25:11,192 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:11,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-12-02 08:25:11,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:11,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:11,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1758863, now seen corresponding path program 1 times [2024-12-02 08:25:11,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:11,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591177182] [2024-12-02 08:25:11,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:11,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:11,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:11,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:11,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591177182] [2024-12-02 08:25:11,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591177182] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:11,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:11,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:25:11,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189589413] [2024-12-02 08:25:11,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:11,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:25:11,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:11,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:25:11,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:25:11,437 INFO L87 Difference]: Start difference. First operand has 1054 states, 632 states have (on average 2.0126582278481013) internal successors, (1272), 1049 states have internal predecessors, (1272), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-12-02 08:25:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:12,313 INFO L93 Difference]: Finished difference Result 1351 states and 1604 transitions. [2024-12-02 08:25:12,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:25:12,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-12-02 08:25:12,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:12,329 INFO L225 Difference]: With dead ends: 1351 [2024-12-02 08:25:12,329 INFO L226 Difference]: Without dead ends: 1347 [2024-12-02 08:25:12,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:25:12,333 INFO L435 NwaCegarLoop]: 1099 mSDtfsCounter, 383 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:12,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 2651 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-02 08:25:12,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2024-12-02 08:25:12,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1261. [2024-12-02 08:25:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 845 states have (on average 1.8804733727810652) internal successors, (1589), 1256 states have internal predecessors, (1589), 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-12-02 08:25:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1595 transitions. [2024-12-02 08:25:12,405 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1595 transitions. Word has length 4 [2024-12-02 08:25:12,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:12,405 INFO L471 AbstractCegarLoop]: Abstraction has 1261 states and 1595 transitions. [2024-12-02 08:25:12,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-12-02 08:25:12,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1595 transitions. [2024-12-02 08:25:12,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-02 08:25:12,406 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:12,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-12-02 08:25:12,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 08:25:12,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:12,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:12,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-12-02 08:25:12,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:12,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519232444] [2024-12-02 08:25:12,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:12,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:12,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:12,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:12,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519232444] [2024-12-02 08:25:12,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519232444] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:12,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:12,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 08:25:12,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532620772] [2024-12-02 08:25:12,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:12,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:25:12,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:12,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:25:12,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:25:12,462 INFO L87 Difference]: Start difference. First operand 1261 states and 1595 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-12-02 08:25:12,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:12,934 INFO L93 Difference]: Finished difference Result 1258 states and 1587 transitions. [2024-12-02 08:25:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:25:12,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-12-02 08:25:12,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:12,938 INFO L225 Difference]: With dead ends: 1258 [2024-12-02 08:25:12,938 INFO L226 Difference]: Without dead ends: 1258 [2024-12-02 08:25:12,938 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-12-02 08:25:12,939 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 1087 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:12,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 862 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 08:25:12,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2024-12-02 08:25:12,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1258. [2024-12-02 08:25:12,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 853 states have (on average 1.8534583821805393) internal successors, (1581), 1253 states have internal predecessors, (1581), 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-12-02 08:25:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1587 transitions. [2024-12-02 08:25:12,961 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1587 transitions. Word has length 4 [2024-12-02 08:25:12,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:12,961 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1587 transitions. [2024-12-02 08:25:12,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-12-02 08:25:12,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1587 transitions. [2024-12-02 08:25:12,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-02 08:25:12,962 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:12,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-12-02 08:25:12,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 08:25:12,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:12,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:12,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-12-02 08:25:12,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:12,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521260201] [2024-12-02 08:25:12,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:12,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:13,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:13,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:13,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521260201] [2024-12-02 08:25:13,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521260201] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:13,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:13,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 08:25:13,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163975255] [2024-12-02 08:25:13,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:13,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:25:13,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:13,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:25:13,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:25:13,034 INFO L87 Difference]: Start difference. First operand 1258 states and 1587 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-12-02 08:25:13,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:13,811 INFO L93 Difference]: Finished difference Result 2018 states and 2492 transitions. [2024-12-02 08:25:13,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:25:13,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-12-02 08:25:13,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:13,817 INFO L225 Difference]: With dead ends: 2018 [2024-12-02 08:25:13,818 INFO L226 Difference]: Without dead ends: 2018 [2024-12-02 08:25:13,818 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-12-02 08:25:13,819 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 904 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:13,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 1695 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-12-02 08:25:13,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2024-12-02 08:25:13,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 1756. [2024-12-02 08:25:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1352 states have (on average 1.827662721893491) internal successors, (2471), 1749 states have internal predecessors, (2471), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:25:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2481 transitions. [2024-12-02 08:25:13,848 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2481 transitions. Word has length 4 [2024-12-02 08:25:13,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:13,848 INFO L471 AbstractCegarLoop]: Abstraction has 1756 states and 2481 transitions. [2024-12-02 08:25:13,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-12-02 08:25:13,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2481 transitions. [2024-12-02 08:25:13,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-02 08:25:13,848 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:13,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:13,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 08:25:13,849 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:13,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1952235122, now seen corresponding path program 1 times [2024-12-02 08:25:13,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:13,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947445187] [2024-12-02 08:25:13,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:13,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:13,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:13,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947445187] [2024-12-02 08:25:13,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947445187] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:13,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:13,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 08:25:13,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087529492] [2024-12-02 08:25:13,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:13,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:25:13,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:13,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:25:13,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:25:13,918 INFO L87 Difference]: Start difference. First operand 1756 states and 2481 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:14,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:14,500 INFO L93 Difference]: Finished difference Result 1795 states and 2413 transitions. [2024-12-02 08:25:14,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:25:14,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-12-02 08:25:14,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:14,504 INFO L225 Difference]: With dead ends: 1795 [2024-12-02 08:25:14,504 INFO L226 Difference]: Without dead ends: 1795 [2024-12-02 08:25:14,504 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-12-02 08:25:14,505 INFO L435 NwaCegarLoop]: 1124 mSDtfsCounter, 1072 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:14,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 1421 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 08:25:14,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2024-12-02 08:25:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1709. [2024-12-02 08:25:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1352 states have (on average 1.7751479289940828) internal successors, (2400), 1702 states have internal predecessors, (2400), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:25:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 2410 transitions. [2024-12-02 08:25:14,533 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 2410 transitions. Word has length 10 [2024-12-02 08:25:14,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:14,533 INFO L471 AbstractCegarLoop]: Abstraction has 1709 states and 2410 transitions. [2024-12-02 08:25:14,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:14,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2410 transitions. [2024-12-02 08:25:14,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-02 08:25:14,533 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:14,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:14,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 08:25:14,534 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:14,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:14,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1952235123, now seen corresponding path program 1 times [2024-12-02 08:25:14,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:14,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380667402] [2024-12-02 08:25:14,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:14,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:14,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:14,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380667402] [2024-12-02 08:25:14,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380667402] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:14,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:14,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 08:25:14,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460323034] [2024-12-02 08:25:14,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:14,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:25:14,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:14,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:25:14,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:25:14,626 INFO L87 Difference]: Start difference. First operand 1709 states and 2410 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:15,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:15,160 INFO L93 Difference]: Finished difference Result 2004 states and 2756 transitions. [2024-12-02 08:25:15,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:25:15,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-12-02 08:25:15,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:15,166 INFO L225 Difference]: With dead ends: 2004 [2024-12-02 08:25:15,166 INFO L226 Difference]: Without dead ends: 2004 [2024-12-02 08:25:15,166 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-12-02 08:25:15,167 INFO L435 NwaCegarLoop]: 1254 mSDtfsCounter, 864 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:15,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 1669 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 08:25:15,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2024-12-02 08:25:15,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1684. [2024-12-02 08:25:15,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1352 states have (on average 1.738905325443787) internal successors, (2351), 1677 states have internal predecessors, (2351), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:25:15,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2361 transitions. [2024-12-02 08:25:15,210 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2361 transitions. Word has length 10 [2024-12-02 08:25:15,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:15,210 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 2361 transitions. [2024-12-02 08:25:15,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:15,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2361 transitions. [2024-12-02 08:25:15,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-02 08:25:15,211 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:15,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:15,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 08:25:15,211 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:15,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:15,212 INFO L85 PathProgramCache]: Analyzing trace with hash -564898849, now seen corresponding path program 1 times [2024-12-02 08:25:15,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:15,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212098175] [2024-12-02 08:25:15,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:15,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:15,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:15,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212098175] [2024-12-02 08:25:15,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212098175] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:15,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:15,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:25:15,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51163072] [2024-12-02 08:25:15,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:15,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:25:15,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:15,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:25:15,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:25:15,270 INFO L87 Difference]: Start difference. First operand 1684 states and 2361 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:15,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:15,765 INFO L93 Difference]: Finished difference Result 1808 states and 2520 transitions. [2024-12-02 08:25:15,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:25:15,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-12-02 08:25:15,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:15,769 INFO L225 Difference]: With dead ends: 1808 [2024-12-02 08:25:15,769 INFO L226 Difference]: Without dead ends: 1808 [2024-12-02 08:25:15,769 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-12-02 08:25:15,769 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 1287 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:15,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1402 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 08:25:15,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2024-12-02 08:25:15,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1661. [2024-12-02 08:25:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1352 states have (on average 1.6878698224852071) internal successors, (2282), 1654 states have internal predecessors, (2282), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:25:15,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2292 transitions. [2024-12-02 08:25:15,802 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2292 transitions. Word has length 14 [2024-12-02 08:25:15,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:15,802 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 2292 transitions. [2024-12-02 08:25:15,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:15,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2292 transitions. [2024-12-02 08:25:15,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-02 08:25:15,803 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:15,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:15,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 08:25:15,803 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr331REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:15,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:15,804 INFO L85 PathProgramCache]: Analyzing trace with hash -564898848, now seen corresponding path program 1 times [2024-12-02 08:25:15,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:15,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688319026] [2024-12-02 08:25:15,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:15,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:15,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:15,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688319026] [2024-12-02 08:25:15,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688319026] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:15,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:15,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:25:15,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644124492] [2024-12-02 08:25:15,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:15,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:25:15,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:15,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:25:15,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:25:15,933 INFO L87 Difference]: Start difference. First operand 1661 states and 2292 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:16,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:16,784 INFO L93 Difference]: Finished difference Result 2162 states and 2775 transitions. [2024-12-02 08:25:16,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:25:16,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-12-02 08:25:16,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:16,790 INFO L225 Difference]: With dead ends: 2162 [2024-12-02 08:25:16,790 INFO L226 Difference]: Without dead ends: 2162 [2024-12-02 08:25:16,790 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-12-02 08:25:16,791 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 1278 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:16,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 2255 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-02 08:25:16,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2024-12-02 08:25:16,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 1757. [2024-12-02 08:25:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1448 states have (on average 1.6685082872928176) internal successors, (2416), 1750 states have internal predecessors, (2416), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:25:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 2426 transitions. [2024-12-02 08:25:16,823 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 2426 transitions. Word has length 14 [2024-12-02 08:25:16,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:16,824 INFO L471 AbstractCegarLoop]: Abstraction has 1757 states and 2426 transitions. [2024-12-02 08:25:16,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:16,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2426 transitions. [2024-12-02 08:25:16,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-02 08:25:16,824 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:16,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:16,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 08:25:16,825 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:16,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:16,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1701595783, now seen corresponding path program 1 times [2024-12-02 08:25:16,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:16,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839513205] [2024-12-02 08:25:16,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:16,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:16,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:16,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:16,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839513205] [2024-12-02 08:25:16,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839513205] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:16,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:16,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 08:25:16,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497821128] [2024-12-02 08:25:16,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:16,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:25:16,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:16,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:25:16,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:25:16,883 INFO L87 Difference]: Start difference. First operand 1757 states and 2426 transitions. Second operand has 4 states, 4 states have (on average 4.0) 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-12-02 08:25:16,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:16,946 INFO L93 Difference]: Finished difference Result 1429 states and 1909 transitions. [2024-12-02 08:25:16,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 08:25:16,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) 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-12-02 08:25:16,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:16,950 INFO L225 Difference]: With dead ends: 1429 [2024-12-02 08:25:16,950 INFO L226 Difference]: Without dead ends: 1429 [2024-12-02 08:25:16,950 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-12-02 08:25:16,951 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 45 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2812 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:16,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2812 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 08:25:16,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2024-12-02 08:25:16,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1429. [2024-12-02 08:25:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 1139 states have (on average 1.6672519754170325) internal successors, (1899), 1422 states have internal predecessors, (1899), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:25:16,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1909 transitions. [2024-12-02 08:25:16,972 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1909 transitions. Word has length 16 [2024-12-02 08:25:16,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:16,973 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 1909 transitions. [2024-12-02 08:25:16,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) 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-12-02 08:25:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1909 transitions. [2024-12-02 08:25:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-02 08:25:16,973 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:16,973 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] [2024-12-02 08:25:16,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 08:25:16,974 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:16,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:16,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2113969666, now seen corresponding path program 1 times [2024-12-02 08:25:16,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:16,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438656097] [2024-12-02 08:25:16,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:16,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:17,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:17,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:17,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438656097] [2024-12-02 08:25:17,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438656097] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:17,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:17,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:25:17,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934384006] [2024-12-02 08:25:17,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:17,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:25:17,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:17,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:25:17,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:25:17,049 INFO L87 Difference]: Start difference. First operand 1429 states and 1909 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:17,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:17,074 INFO L93 Difference]: Finished difference Result 1279 states and 1679 transitions. [2024-12-02 08:25:17,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:25:17,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-12-02 08:25:17,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:17,077 INFO L225 Difference]: With dead ends: 1279 [2024-12-02 08:25:17,077 INFO L226 Difference]: Without dead ends: 1279 [2024-12-02 08:25:17,078 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-12-02 08:25:17,078 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 71 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1617 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-12-02 08:25:17,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1617 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 08:25:17,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2024-12-02 08:25:17,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2024-12-02 08:25:17,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 1013 states have (on average 1.6475814412635736) internal successors, (1669), 1272 states have internal predecessors, (1669), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:25:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1679 transitions. [2024-12-02 08:25:17,097 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1679 transitions. Word has length 20 [2024-12-02 08:25:17,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:17,097 INFO L471 AbstractCegarLoop]: Abstraction has 1279 states and 1679 transitions. [2024-12-02 08:25:17,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:17,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1679 transitions. [2024-12-02 08:25:17,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-02 08:25:17,098 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:17,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] [2024-12-02 08:25:17,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 08:25:17,098 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:17,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:17,098 INFO L85 PathProgramCache]: Analyzing trace with hash 5595258, now seen corresponding path program 1 times [2024-12-02 08:25:17,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:17,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226717623] [2024-12-02 08:25:17,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:17,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:17,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:17,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226717623] [2024-12-02 08:25:17,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226717623] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:17,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:17,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 08:25:17,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139758428] [2024-12-02 08:25:17,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:17,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:25:17,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:17,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:25:17,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:25:17,174 INFO L87 Difference]: Start difference. First operand 1279 states and 1679 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-12-02 08:25:17,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:17,229 INFO L93 Difference]: Finished difference Result 1249 states and 1621 transitions. [2024-12-02 08:25:17,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 08:25:17,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-12-02 08:25:17,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:17,234 INFO L225 Difference]: With dead ends: 1249 [2024-12-02 08:25:17,234 INFO L226 Difference]: Without dead ends: 1249 [2024-12-02 08:25:17,234 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-12-02 08:25:17,235 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 48 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:17,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2359 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 08:25:17,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-12-02 08:25:17,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2024-12-02 08:25:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 997 states have (on average 1.6158475426278835) internal successors, (1611), 1242 states have internal predecessors, (1611), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:25:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1621 transitions. [2024-12-02 08:25:17,253 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1621 transitions. Word has length 22 [2024-12-02 08:25:17,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:17,253 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1621 transitions. [2024-12-02 08:25:17,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-12-02 08:25:17,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1621 transitions. [2024-12-02 08:25:17,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-02 08:25:17,254 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:17,255 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] [2024-12-02 08:25:17,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 08:25:17,255 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:17,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:17,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1582467048, now seen corresponding path program 1 times [2024-12-02 08:25:17,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:17,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170052668] [2024-12-02 08:25:17,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:17,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:17,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:17,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:17,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170052668] [2024-12-02 08:25:17,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170052668] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:17,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:17,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:25:17,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834636390] [2024-12-02 08:25:17,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:17,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:25:17,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:17,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:25:17,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:25:17,330 INFO L87 Difference]: Start difference. First operand 1249 states and 1621 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:17,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:17,849 INFO L93 Difference]: Finished difference Result 1383 states and 1768 transitions. [2024-12-02 08:25:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:25:17,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-12-02 08:25:17,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:17,854 INFO L225 Difference]: With dead ends: 1383 [2024-12-02 08:25:17,854 INFO L226 Difference]: Without dead ends: 1383 [2024-12-02 08:25:17,854 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-12-02 08:25:17,855 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 925 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:17,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1566 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 08:25:17,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-12-02 08:25:17,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1245. [2024-12-02 08:25:17,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 997 states have (on average 1.6078234704112337) internal successors, (1603), 1238 states have internal predecessors, (1603), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:25:17,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1613 transitions. [2024-12-02 08:25:17,873 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1613 transitions. Word has length 36 [2024-12-02 08:25:17,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:17,873 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1613 transitions. [2024-12-02 08:25:17,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:17,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1613 transitions. [2024-12-02 08:25:17,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-02 08:25:17,874 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:17,874 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] [2024-12-02 08:25:17,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 08:25:17,874 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:17,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:17,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1582467049, now seen corresponding path program 1 times [2024-12-02 08:25:17,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:17,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140586452] [2024-12-02 08:25:17,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:17,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:18,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:18,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140586452] [2024-12-02 08:25:18,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140586452] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:18,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:18,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:25:18,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954242102] [2024-12-02 08:25:18,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:18,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:25:18,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:18,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:25:18,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:25:18,030 INFO L87 Difference]: Start difference. First operand 1245 states and 1613 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:18,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:18,662 INFO L93 Difference]: Finished difference Result 1829 states and 2411 transitions. [2024-12-02 08:25:18,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:25:18,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-12-02 08:25:18,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:18,668 INFO L225 Difference]: With dead ends: 1829 [2024-12-02 08:25:18,668 INFO L226 Difference]: Without dead ends: 1829 [2024-12-02 08:25:18,668 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-12-02 08:25:18,669 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 659 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:18,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1910 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 08:25:18,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2024-12-02 08:25:18,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1241. [2024-12-02 08:25:18,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 997 states have (on average 1.5997993981945837) internal successors, (1595), 1234 states have internal predecessors, (1595), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:25:18,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1605 transitions. [2024-12-02 08:25:18,688 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1605 transitions. Word has length 36 [2024-12-02 08:25:18,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:18,688 INFO L471 AbstractCegarLoop]: Abstraction has 1241 states and 1605 transitions. [2024-12-02 08:25:18,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:18,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1605 transitions. [2024-12-02 08:25:18,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-02 08:25:18,690 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:18,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:18,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 08:25:18,690 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:18,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1978501923, now seen corresponding path program 1 times [2024-12-02 08:25:18,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:18,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136866904] [2024-12-02 08:25:18,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:18,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:18,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:18,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136866904] [2024-12-02 08:25:18,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136866904] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:18,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:18,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 08:25:18,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046864880] [2024-12-02 08:25:18,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:18,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:25:18,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:18,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:25:18,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:25:18,786 INFO L87 Difference]: Start difference. First operand 1241 states and 1605 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:18,830 INFO L93 Difference]: Finished difference Result 1223 states and 1575 transitions. [2024-12-02 08:25:18,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 08:25:18,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-12-02 08:25:18,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:18,834 INFO L225 Difference]: With dead ends: 1223 [2024-12-02 08:25:18,834 INFO L226 Difference]: Without dead ends: 1223 [2024-12-02 08:25:18,834 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-12-02 08:25:18,835 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 27 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:18,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2330 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 08:25:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2024-12-02 08:25:18,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1223. [2024-12-02 08:25:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 979 states have (on average 1.5985699693564863) internal successors, (1565), 1216 states have internal predecessors, (1565), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:25:18,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1575 transitions. [2024-12-02 08:25:18,852 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1575 transitions. Word has length 62 [2024-12-02 08:25:18,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:18,852 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1575 transitions. [2024-12-02 08:25:18,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:18,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1575 transitions. [2024-12-02 08:25:18,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-12-02 08:25:18,853 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:18,853 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] [2024-12-02 08:25:18,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 08:25:18,854 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:18,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:18,854 INFO L85 PathProgramCache]: Analyzing trace with hash -12119383, now seen corresponding path program 1 times [2024-12-02 08:25:18,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:18,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106075326] [2024-12-02 08:25:18,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:18,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:18,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:18,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:18,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106075326] [2024-12-02 08:25:18,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106075326] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:18,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:18,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:25:18,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203595308] [2024-12-02 08:25:18,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:18,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:25:18,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:18,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:25:18,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:25:18,963 INFO L87 Difference]: Start difference. First operand 1223 states and 1575 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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-12-02 08:25:19,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:19,014 INFO L93 Difference]: Finished difference Result 1495 states and 1889 transitions. [2024-12-02 08:25:19,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:25:19,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-12-02 08:25:19,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:19,018 INFO L225 Difference]: With dead ends: 1495 [2024-12-02 08:25:19,018 INFO L226 Difference]: Without dead ends: 1495 [2024-12-02 08:25:19,018 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-12-02 08:25:19,019 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 206 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:19,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1569 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 08:25:19,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2024-12-02 08:25:19,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1482. [2024-12-02 08:25:19,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1238 states have (on average 1.5145395799676897) internal successors, (1875), 1475 states have internal predecessors, (1875), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:25:19,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 1885 transitions. [2024-12-02 08:25:19,038 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 1885 transitions. Word has length 70 [2024-12-02 08:25:19,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:19,038 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 1885 transitions. [2024-12-02 08:25:19,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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-12-02 08:25:19,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1885 transitions. [2024-12-02 08:25:19,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-12-02 08:25:19,039 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:19,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:25:19,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 08:25:19,040 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:19,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:19,040 INFO L85 PathProgramCache]: Analyzing trace with hash 836446931, now seen corresponding path program 1 times [2024-12-02 08:25:19,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:19,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014919827] [2024-12-02 08:25:19,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:19,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:19,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:19,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014919827] [2024-12-02 08:25:19,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014919827] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:19,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:19,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 08:25:19,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135643601] [2024-12-02 08:25:19,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:19,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 08:25:19,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:19,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 08:25:19,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-12-02 08:25:19,491 INFO L87 Difference]: Start difference. First operand 1482 states and 1885 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:19,650 INFO L93 Difference]: Finished difference Result 2102 states and 2618 transitions. [2024-12-02 08:25:19,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 08:25:19,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-12-02 08:25:19,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:19,655 INFO L225 Difference]: With dead ends: 2102 [2024-12-02 08:25:19,656 INFO L226 Difference]: Without dead ends: 2099 [2024-12-02 08:25:19,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 08:25:19,656 INFO L435 NwaCegarLoop]: 1009 mSDtfsCounter, 734 mSDsluCounter, 3498 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 4507 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:19,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 4507 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 08:25:19,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2024-12-02 08:25:19,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1383. [2024-12-02 08:25:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1139 states have (on average 1.533801580333626) internal successors, (1747), 1376 states have internal predecessors, (1747), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:25:19,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1757 transitions. [2024-12-02 08:25:19,679 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1757 transitions. Word has length 76 [2024-12-02 08:25:19,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:19,679 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 1757 transitions. [2024-12-02 08:25:19,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:19,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1757 transitions. [2024-12-02 08:25:19,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-02 08:25:19,680 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:19,680 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] [2024-12-02 08:25:19,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 08:25:19,680 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:19,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:19,681 INFO L85 PathProgramCache]: Analyzing trace with hash 5623378, now seen corresponding path program 1 times [2024-12-02 08:25:19,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:19,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061716737] [2024-12-02 08:25:19,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:19,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:19,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:19,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:19,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061716737] [2024-12-02 08:25:19,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061716737] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:19,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:19,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 08:25:19,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036148773] [2024-12-02 08:25:19,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:19,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:25:19,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:19,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:25:19,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:25:19,801 INFO L87 Difference]: Start difference. First operand 1383 states and 1757 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:19,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:19,845 INFO L93 Difference]: Finished difference Result 1365 states and 1727 transitions. [2024-12-02 08:25:19,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 08:25:19,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-12-02 08:25:19,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:19,849 INFO L225 Difference]: With dead ends: 1365 [2024-12-02 08:25:19,849 INFO L226 Difference]: Without dead ends: 1365 [2024-12-02 08:25:19,849 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-12-02 08:25:19,850 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 21 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:19,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2324 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 08:25:19,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2024-12-02 08:25:19,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1365. [2024-12-02 08:25:19,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1121 states have (on average 1.5316681534344336) internal successors, (1717), 1358 states have internal predecessors, (1717), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:25:19,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1727 transitions. [2024-12-02 08:25:19,870 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1727 transitions. Word has length 78 [2024-12-02 08:25:19,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:19,870 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 1727 transitions. [2024-12-02 08:25:19,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:25:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1727 transitions. [2024-12-02 08:25:19,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-02 08:25:19,871 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:19,871 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] [2024-12-02 08:25:19,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 08:25:19,871 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:19,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:19,871 INFO L85 PathProgramCache]: Analyzing trace with hash -18190178, now seen corresponding path program 1 times [2024-12-02 08:25:19,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:19,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434036661] [2024-12-02 08:25:19,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:19,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:20,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:20,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:20,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434036661] [2024-12-02 08:25:20,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434036661] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:20,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:20,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 08:25:20,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008748867] [2024-12-02 08:25:20,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:20,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 08:25:20,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:20,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 08:25:20,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 08:25:20,146 INFO L87 Difference]: Start difference. First operand 1365 states and 1727 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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-12-02 08:25:20,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:20,666 INFO L93 Difference]: Finished difference Result 1364 states and 1725 transitions. [2024-12-02 08:25:20,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 08:25:20,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-12-02 08:25:20,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:20,670 INFO L225 Difference]: With dead ends: 1364 [2024-12-02 08:25:20,670 INFO L226 Difference]: Without dead ends: 1364 [2024-12-02 08:25:20,671 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-12-02 08:25:20,671 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 2 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2331 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:20,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2331 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 08:25:20,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2024-12-02 08:25:20,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2024-12-02 08:25:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1121 states have (on average 1.5298840321141838) internal successors, (1715), 1357 states have internal predecessors, (1715), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:25:20,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1725 transitions. [2024-12-02 08:25:20,693 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1725 transitions. Word has length 86 [2024-12-02 08:25:20,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:20,693 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 1725 transitions. [2024-12-02 08:25:20,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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-12-02 08:25:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1725 transitions. [2024-12-02 08:25:20,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-02 08:25:20,694 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:20,694 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] [2024-12-02 08:25:20,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 08:25:20,694 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:20,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:20,695 INFO L85 PathProgramCache]: Analyzing trace with hash -18190177, now seen corresponding path program 1 times [2024-12-02 08:25:20,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:20,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927302340] [2024-12-02 08:25:20,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:20,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:21,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:21,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927302340] [2024-12-02 08:25:21,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927302340] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:21,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:21,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 08:25:21,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834448237] [2024-12-02 08:25:21,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:21,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 08:25:21,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:21,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 08:25:21,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 08:25:21,177 INFO L87 Difference]: Start difference. First operand 1364 states and 1725 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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-12-02 08:25:21,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:21,847 INFO L93 Difference]: Finished difference Result 1363 states and 1723 transitions. [2024-12-02 08:25:21,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 08:25:21,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-12-02 08:25:21,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:21,851 INFO L225 Difference]: With dead ends: 1363 [2024-12-02 08:25:21,851 INFO L226 Difference]: Without dead ends: 1363 [2024-12-02 08:25:21,851 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-12-02 08:25:21,852 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 1 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:21,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2257 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 08:25:21,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2024-12-02 08:25:21,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1363. [2024-12-02 08:25:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1119 states have (on average 1.5308310991957104) internal successors, (1713), 1356 states have internal predecessors, (1713), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:25:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1723 transitions. [2024-12-02 08:25:21,870 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1723 transitions. Word has length 86 [2024-12-02 08:25:21,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:21,870 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1723 transitions. [2024-12-02 08:25:21,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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-12-02 08:25:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1723 transitions. [2024-12-02 08:25:21,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-02 08:25:21,871 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:21,871 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-12-02 08:25:21,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 08:25:21,871 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:21,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:21,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1418734117, now seen corresponding path program 1 times [2024-12-02 08:25:21,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:21,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488544232] [2024-12-02 08:25:21,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:21,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:22,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:22,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488544232] [2024-12-02 08:25:22,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488544232] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:22,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:22,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 08:25:22,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289593414] [2024-12-02 08:25:22,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:22,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 08:25:22,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:22,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 08:25:22,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 08:25:22,103 INFO L87 Difference]: Start difference. First operand 1363 states and 1723 transitions. Second operand has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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-12-02 08:25:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:22,698 INFO L93 Difference]: Finished difference Result 1381 states and 1749 transitions. [2024-12-02 08:25:22,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 08:25:22,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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-12-02 08:25:22,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:22,704 INFO L225 Difference]: With dead ends: 1381 [2024-12-02 08:25:22,704 INFO L226 Difference]: Without dead ends: 1381 [2024-12-02 08:25:22,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-12-02 08:25:22,705 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 6 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3128 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:22,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3128 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 08:25:22,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2024-12-02 08:25:22,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1372. [2024-12-02 08:25:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1127 states have (on average 1.5297249334516416) internal successors, (1724), 1363 states have internal predecessors, (1724), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-12-02 08:25:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1739 transitions. [2024-12-02 08:25:22,727 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1739 transitions. Word has length 94 [2024-12-02 08:25:22,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:22,727 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 1739 transitions. [2024-12-02 08:25:22,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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-12-02 08:25:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1739 transitions. [2024-12-02 08:25:22,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-02 08:25:22,728 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:22,728 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-12-02 08:25:22,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 08:25:22,728 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:22,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:22,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1418734118, now seen corresponding path program 1 times [2024-12-02 08:25:22,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:22,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513012631] [2024-12-02 08:25:22,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:22,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:23,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:23,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:23,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513012631] [2024-12-02 08:25:23,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513012631] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:23,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:23,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 08:25:23,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30077139] [2024-12-02 08:25:23,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:23,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 08:25:23,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:23,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 08:25:23,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:25:23,206 INFO L87 Difference]: Start difference. First operand 1372 states and 1739 transitions. Second operand has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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-12-02 08:25:23,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:23,858 INFO L93 Difference]: Finished difference Result 1372 states and 1737 transitions. [2024-12-02 08:25:23,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 08:25:23,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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-12-02 08:25:23,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:23,861 INFO L225 Difference]: With dead ends: 1372 [2024-12-02 08:25:23,861 INFO L226 Difference]: Without dead ends: 1372 [2024-12-02 08:25:23,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-12-02 08:25:23,862 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 1 mSDsluCounter, 2137 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:23,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2929 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 08:25:23,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2024-12-02 08:25:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1372. [2024-12-02 08:25:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1127 states have (on average 1.5279503105590062) internal successors, (1722), 1363 states have internal predecessors, (1722), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-12-02 08:25:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1737 transitions. [2024-12-02 08:25:23,879 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1737 transitions. Word has length 94 [2024-12-02 08:25:23,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:23,880 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 1737 transitions. [2024-12-02 08:25:23,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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-12-02 08:25:23,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1737 transitions. [2024-12-02 08:25:23,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-02 08:25:23,880 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:23,880 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] [2024-12-02 08:25:23,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 08:25:23,881 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:23,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:23,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1624609176, now seen corresponding path program 1 times [2024-12-02 08:25:23,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:23,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198627208] [2024-12-02 08:25:23,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:23,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:24,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:24,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198627208] [2024-12-02 08:25:24,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198627208] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:25:24,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444998614] [2024-12-02 08:25:24,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:24,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:25:24,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:25:24,224 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:25:24,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 08:25:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:24,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-12-02 08:25:24,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:25:24,481 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-12-02 08:25:24,620 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-12-02 08:25:24,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-12-02 08:25:24,659 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-12-02 08:25:24,745 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-12-02 08:25:24,916 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:25:24,916 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:25:24,967 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-12-02 08:25:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:25,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:25:25,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444998614] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:25:25,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:25:25,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-12-02 08:25:25,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277133803] [2024-12-02 08:25:25,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 08:25:25,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 08:25:25,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:25,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 08:25:25,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=319, Unknown=5, NotChecked=0, Total=380 [2024-12-02 08:25:25,071 INFO L87 Difference]: Start difference. First operand 1372 states and 1737 transitions. Second operand has 19 states, 16 states have (on average 9.3125) internal successors, (149), 18 states have internal predecessors, (149), 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-12-02 08:25:26,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:26,708 INFO L93 Difference]: Finished difference Result 1379 states and 1743 transitions. [2024-12-02 08:25:26,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 08:25:26,708 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.3125) internal successors, (149), 18 states have internal predecessors, (149), 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 95 [2024-12-02 08:25:26,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:26,711 INFO L225 Difference]: With dead ends: 1379 [2024-12-02 08:25:26,711 INFO L226 Difference]: Without dead ends: 1379 [2024-12-02 08:25:26,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=464, Unknown=5, NotChecked=0, Total=552 [2024-12-02 08:25:26,712 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 710 mSDsluCounter, 4867 mSDsCounter, 0 mSdLazyCounter, 3358 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 5369 SdHoareTripleChecker+Invalid, 3372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:26,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 5369 Invalid, 3372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3358 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-12-02 08:25:26,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-12-02 08:25:26,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1376. [2024-12-02 08:25:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1131 states have (on average 1.5251989389920424) internal successors, (1725), 1366 states have internal predecessors, (1725), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-12-02 08:25:26,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1737 transitions. [2024-12-02 08:25:26,731 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1737 transitions. Word has length 95 [2024-12-02 08:25:26,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:26,731 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 1737 transitions. [2024-12-02 08:25:26,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.3125) internal successors, (149), 18 states have internal predecessors, (149), 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-12-02 08:25:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1737 transitions. [2024-12-02 08:25:26,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-02 08:25:26,732 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:26,732 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] [2024-12-02 08:25:26,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 08:25:26,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-12-02 08:25:26,933 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:26,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1624609177, now seen corresponding path program 1 times [2024-12-02 08:25:26,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:26,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754753896] [2024-12-02 08:25:26,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:26,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:27,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:27,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754753896] [2024-12-02 08:25:27,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754753896] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:25:27,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652102379] [2024-12-02 08:25:27,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:27,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:25:27,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:25:27,470 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:25:27,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 08:25:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:27,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-12-02 08:25:27,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:25:27,689 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-12-02 08:25:27,792 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 08:25:27,792 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-12-02 08:25:27,798 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-12-02 08:25:27,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 08:25:27,830 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-12-02 08:25:27,916 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-12-02 08:25:27,921 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-12-02 08:25:28,021 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:25:28,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-02 08:25:28,028 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-12-02 08:25:28,056 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-12-02 08:25:28,061 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-12-02 08:25:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:28,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:25:28,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652102379] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:25:28,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:25:28,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-12-02 08:25:28,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947881815] [2024-12-02 08:25:28,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 08:25:28,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-12-02 08:25:28,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:28,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-12-02 08:25:28,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=347, Unknown=12, NotChecked=0, Total=420 [2024-12-02 08:25:28,209 INFO L87 Difference]: Start difference. First operand 1376 states and 1737 transitions. Second operand has 18 states, 15 states have (on average 9.933333333333334) internal successors, (149), 18 states have internal predecessors, (149), 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-12-02 08:25:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:30,418 INFO L93 Difference]: Finished difference Result 1378 states and 1741 transitions. [2024-12-02 08:25:30,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 08:25:30,418 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.933333333333334) internal successors, (149), 18 states have internal predecessors, (149), 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 95 [2024-12-02 08:25:30,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:30,420 INFO L225 Difference]: With dead ends: 1378 [2024-12-02 08:25:30,420 INFO L226 Difference]: Without dead ends: 1378 [2024-12-02 08:25:30,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=492, Unknown=13, NotChecked=0, Total=600 [2024-12-02 08:25:30,421 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 704 mSDsluCounter, 4476 mSDsCounter, 0 mSdLazyCounter, 4587 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 4981 SdHoareTripleChecker+Invalid, 4607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:30,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 4981 Invalid, 4607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4587 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-12-02 08:25:30,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2024-12-02 08:25:30,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1366. [2024-12-02 08:25:30,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1123 states have (on average 1.5262689225289403) internal successors, (1714), 1358 states have internal predecessors, (1714), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:25:30,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1724 transitions. [2024-12-02 08:25:30,433 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1724 transitions. Word has length 95 [2024-12-02 08:25:30,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:30,433 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 1724 transitions. [2024-12-02 08:25:30,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.933333333333334) internal successors, (149), 18 states have internal predecessors, (149), 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-12-02 08:25:30,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1724 transitions. [2024-12-02 08:25:30,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-02 08:25:30,434 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:30,434 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-12-02 08:25:30,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 08:25:30,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-12-02 08:25:30,635 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:30,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:30,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1264437883, now seen corresponding path program 1 times [2024-12-02 08:25:30,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:30,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216896564] [2024-12-02 08:25:30,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:30,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:31,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:31,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216896564] [2024-12-02 08:25:31,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216896564] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:31,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:31,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-12-02 08:25:31,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261392027] [2024-12-02 08:25:31,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:31,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 08:25:31,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:31,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 08:25:31,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-12-02 08:25:31,124 INFO L87 Difference]: Start difference. First operand 1366 states and 1724 transitions. Second operand has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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-12-02 08:25:32,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:32,207 INFO L93 Difference]: Finished difference Result 1385 states and 1749 transitions. [2024-12-02 08:25:32,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 08:25:32,208 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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-12-02 08:25:32,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:32,211 INFO L225 Difference]: With dead ends: 1385 [2024-12-02 08:25:32,211 INFO L226 Difference]: Without dead ends: 1385 [2024-12-02 08:25:32,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-12-02 08:25:32,212 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 738 mSDsluCounter, 3436 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 3938 SdHoareTripleChecker+Invalid, 2494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:32,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 3938 Invalid, 2494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2481 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-12-02 08:25:32,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-12-02 08:25:32,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1381. [2024-12-02 08:25:32,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1137 states have (on average 1.5224274406332454) internal successors, (1731), 1371 states have internal predecessors, (1731), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-12-02 08:25:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1743 transitions. [2024-12-02 08:25:32,223 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1743 transitions. Word has length 97 [2024-12-02 08:25:32,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:32,223 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1743 transitions. [2024-12-02 08:25:32,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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-12-02 08:25:32,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1743 transitions. [2024-12-02 08:25:32,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-02 08:25:32,224 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:32,224 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-12-02 08:25:32,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 08:25:32,225 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:32,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:32,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1264437882, now seen corresponding path program 1 times [2024-12-02 08:25:32,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:32,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729614577] [2024-12-02 08:25:32,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:32,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:32,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:32,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729614577] [2024-12-02 08:25:32,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729614577] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:32,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:32,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 08:25:32,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295793863] [2024-12-02 08:25:32,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:32,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 08:25:32,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:32,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 08:25:32,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-12-02 08:25:32,710 INFO L87 Difference]: Start difference. First operand 1381 states and 1743 transitions. Second operand has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 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-12-02 08:25:34,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:34,098 INFO L93 Difference]: Finished difference Result 1384 states and 1747 transitions. [2024-12-02 08:25:34,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 08:25:34,099 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 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-12-02 08:25:34,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:34,101 INFO L225 Difference]: With dead ends: 1384 [2024-12-02 08:25:34,101 INFO L226 Difference]: Without dead ends: 1384 [2024-12-02 08:25:34,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-12-02 08:25:34,101 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 714 mSDsluCounter, 2495 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 2615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:34,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 3001 Invalid, 2615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-12-02 08:25:34,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-12-02 08:25:34,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1381. [2024-12-02 08:25:34,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1137 states have (on average 1.5206684256816183) internal successors, (1729), 1371 states have internal predecessors, (1729), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-12-02 08:25:34,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1741 transitions. [2024-12-02 08:25:34,120 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1741 transitions. Word has length 97 [2024-12-02 08:25:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:34,120 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1741 transitions. [2024-12-02 08:25:34,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 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-12-02 08:25:34,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1741 transitions. [2024-12-02 08:25:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-12-02 08:25:34,121 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:34,121 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] [2024-12-02 08:25:34,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-02 08:25:34,121 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:34,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:34,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1253853902, now seen corresponding path program 1 times [2024-12-02 08:25:34,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:34,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015726081] [2024-12-02 08:25:34,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:34,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:34,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:34,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:34,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015726081] [2024-12-02 08:25:34,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015726081] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:25:34,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141570336] [2024-12-02 08:25:34,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:34,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:25:34,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:25:34,653 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:25:34,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 08:25:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:34,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-12-02 08:25:34,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:25:34,847 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-12-02 08:25:34,937 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-12-02 08:25:34,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-12-02 08:25:34,960 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-12-02 08:25:35,027 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-12-02 08:25:35,175 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:25:35,175 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:25:35,254 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:25:35,254 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:25:35,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 08:25:35,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:35,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:25:35,375 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1063 (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$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1066))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1063)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-12-02 08:25:35,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141570336] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:25:35,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:25:35,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-12-02 08:25:35,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555497034] [2024-12-02 08:25:35,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 08:25:35,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-12-02 08:25:35,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:35,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-12-02 08:25:35,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=456, Unknown=18, NotChecked=44, Total=600 [2024-12-02 08:25:35,378 INFO L87 Difference]: Start difference. First operand 1381 states and 1741 transitions. Second operand has 22 states, 19 states have (on average 8.157894736842104) internal successors, (155), 21 states have internal predecessors, (155), 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-12-02 08:25:37,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:37,579 INFO L93 Difference]: Finished difference Result 1383 states and 1745 transitions. [2024-12-02 08:25:37,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 08:25:37,579 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.157894736842104) internal successors, (155), 21 states have internal predecessors, (155), 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 98 [2024-12-02 08:25:37,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:37,581 INFO L225 Difference]: With dead ends: 1383 [2024-12-02 08:25:37,581 INFO L226 Difference]: Without dead ends: 1383 [2024-12-02 08:25:37,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=583, Unknown=19, NotChecked=50, Total=756 [2024-12-02 08:25:37,582 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 693 mSDsluCounter, 6353 mSDsCounter, 0 mSdLazyCounter, 4281 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 6854 SdHoareTripleChecker+Invalid, 4294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:37,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 6854 Invalid, 4294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4281 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-12-02 08:25:37,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-12-02 08:25:37,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1380. [2024-12-02 08:25:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1137 states have (on average 1.5189094107299912) internal successors, (1727), 1370 states have internal predecessors, (1727), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-12-02 08:25:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1739 transitions. [2024-12-02 08:25:37,591 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1739 transitions. Word has length 98 [2024-12-02 08:25:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:37,591 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 1739 transitions. [2024-12-02 08:25:37,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.157894736842104) internal successors, (155), 21 states have internal predecessors, (155), 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-12-02 08:25:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1739 transitions. [2024-12-02 08:25:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-12-02 08:25:37,592 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:37,592 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] [2024-12-02 08:25:37,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 08:25:37,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-12-02 08:25:37,792 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:37,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:37,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1253853901, now seen corresponding path program 1 times [2024-12-02 08:25:37,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:37,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501609651] [2024-12-02 08:25:37,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:37,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:38,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:38,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501609651] [2024-12-02 08:25:38,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501609651] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:25:38,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624942091] [2024-12-02 08:25:38,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:38,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:25:38,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:25:38,398 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:25:38,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 08:25:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:38,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-12-02 08:25:38,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:25:38,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-12-02 08:25:38,698 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-12-02 08:25:38,715 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 08:25:38,715 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-12-02 08:25:38,726 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-12-02 08:25:38,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 08:25:38,791 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-12-02 08:25:38,795 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-12-02 08:25:38,869 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:25:38,870 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:25:38,876 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-12-02 08:25:38,927 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:25:38,927 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:25:38,932 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-12-02 08:25:38,949 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-12-02 08:25:38,953 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-12-02 08:25:38,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:38,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:25:39,035 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1218 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1217) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-12-02 08:25:39,077 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1223))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1224) .cse0 v_ArrVal_1218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1217) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1224) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-12-02 08:25:39,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624942091] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:25:39,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:25:39,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2024-12-02 08:25:39,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851914392] [2024-12-02 08:25:39,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 08:25:39,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-12-02 08:25:39,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:39,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-12-02 08:25:39,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=8, NotChecked=74, Total=462 [2024-12-02 08:25:39,080 INFO L87 Difference]: Start difference. First operand 1380 states and 1739 transitions. Second operand has 17 states, 14 states have (on average 10.571428571428571) internal successors, (148), 17 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 08:25:41,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:41,311 INFO L93 Difference]: Finished difference Result 1382 states and 1743 transitions. [2024-12-02 08:25:41,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 08:25:41,311 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.571428571428571) internal successors, (148), 17 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 98 [2024-12-02 08:25:41,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:41,314 INFO L225 Difference]: With dead ends: 1382 [2024-12-02 08:25:41,314 INFO L226 Difference]: Without dead ends: 1382 [2024-12-02 08:25:41,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=493, Unknown=10, NotChecked=94, Total=702 [2024-12-02 08:25:41,315 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 698 mSDsluCounter, 4574 mSDsCounter, 0 mSdLazyCounter, 4400 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 5078 SdHoareTripleChecker+Invalid, 4415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:41,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 5078 Invalid, 4415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4400 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-12-02 08:25:41,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-12-02 08:25:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1364. [2024-12-02 08:25:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1123 states have (on average 1.522707034728406) internal successors, (1710), 1356 states have internal predecessors, (1710), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:25:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1720 transitions. [2024-12-02 08:25:41,329 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1720 transitions. Word has length 98 [2024-12-02 08:25:41,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:41,329 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 1720 transitions. [2024-12-02 08:25:41,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.571428571428571) internal successors, (148), 17 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 08:25:41,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1720 transitions. [2024-12-02 08:25:41,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-12-02 08:25:41,329 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:41,329 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-12-02 08:25:41,336 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-12-02 08:25:41,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-12-02 08:25:41,530 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:41,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:41,530 INFO L85 PathProgramCache]: Analyzing trace with hash -2005137076, now seen corresponding path program 1 times [2024-12-02 08:25:41,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:41,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075471295] [2024-12-02 08:25:41,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:41,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:41,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:41,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075471295] [2024-12-02 08:25:41,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075471295] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:41,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:41,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-12-02 08:25:41,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909126012] [2024-12-02 08:25:41,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:41,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-12-02 08:25:41,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:41,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-12-02 08:25:41,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-12-02 08:25:41,916 INFO L87 Difference]: Start difference. First operand 1364 states and 1720 transitions. Second operand has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 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-12-02 08:25:42,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:42,977 INFO L93 Difference]: Finished difference Result 1389 states and 1751 transitions. [2024-12-02 08:25:42,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 08:25:42,978 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 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-12-02 08:25:42,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:42,980 INFO L225 Difference]: With dead ends: 1389 [2024-12-02 08:25:42,980 INFO L226 Difference]: Without dead ends: 1389 [2024-12-02 08:25:42,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-12-02 08:25:42,981 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 741 mSDsluCounter, 3431 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 3932 SdHoareTripleChecker+Invalid, 2494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:42,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 3932 Invalid, 2494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2481 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-12-02 08:25:42,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2024-12-02 08:25:42,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1385. [2024-12-02 08:25:42,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1143 states have (on average 1.5161854768153982) internal successors, (1733), 1375 states have internal predecessors, (1733), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-12-02 08:25:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1745 transitions. [2024-12-02 08:25:42,996 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1745 transitions. Word has length 100 [2024-12-02 08:25:42,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:42,996 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1745 transitions. [2024-12-02 08:25:42,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 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-12-02 08:25:42,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1745 transitions. [2024-12-02 08:25:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-12-02 08:25:42,997 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:42,997 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-12-02 08:25:42,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-02 08:25:42,997 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:42,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:42,998 INFO L85 PathProgramCache]: Analyzing trace with hash -2005137075, now seen corresponding path program 1 times [2024-12-02 08:25:42,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:42,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957286872] [2024-12-02 08:25:42,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:42,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:43,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:43,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957286872] [2024-12-02 08:25:43,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957286872] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:43,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:43,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-12-02 08:25:43,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858686586] [2024-12-02 08:25:43,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:43,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 08:25:43,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:43,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 08:25:43,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-12-02 08:25:43,532 INFO L87 Difference]: Start difference. First operand 1385 states and 1745 transitions. Second operand has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 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-12-02 08:25:45,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:45,110 INFO L93 Difference]: Finished difference Result 1388 states and 1749 transitions. [2024-12-02 08:25:45,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 08:25:45,110 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 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-12-02 08:25:45,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:45,112 INFO L225 Difference]: With dead ends: 1388 [2024-12-02 08:25:45,112 INFO L226 Difference]: Without dead ends: 1388 [2024-12-02 08:25:45,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-12-02 08:25:45,113 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 716 mSDsluCounter, 3333 mSDsCounter, 0 mSdLazyCounter, 3314 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 3838 SdHoareTripleChecker+Invalid, 3325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:45,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 3838 Invalid, 3325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3314 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-12-02 08:25:45,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-12-02 08:25:45,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1385. [2024-12-02 08:25:45,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1143 states have (on average 1.5144356955380578) internal successors, (1731), 1375 states have internal predecessors, (1731), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-12-02 08:25:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1743 transitions. [2024-12-02 08:25:45,142 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1743 transitions. Word has length 100 [2024-12-02 08:25:45,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:45,142 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1743 transitions. [2024-12-02 08:25:45,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 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-12-02 08:25:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1743 transitions. [2024-12-02 08:25:45,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-02 08:25:45,143 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:45,143 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] [2024-12-02 08:25:45,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-02 08:25:45,144 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:45,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:45,144 INFO L85 PathProgramCache]: Analyzing trace with hash -230371713, now seen corresponding path program 1 times [2024-12-02 08:25:45,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:45,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832954025] [2024-12-02 08:25:45,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:45,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:45,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:45,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:45,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832954025] [2024-12-02 08:25:45,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832954025] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:25:45,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026791181] [2024-12-02 08:25:45,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:45,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:25:45,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:25:45,524 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:25:45,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 08:25:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:45,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-12-02 08:25:45,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:25:45,742 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-12-02 08:25:45,835 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-12-02 08:25:45,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-12-02 08:25:45,859 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-12-02 08:25:45,937 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-12-02 08:25:46,077 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:25:46,077 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:25:46,161 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:25:46,161 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:25:46,224 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:25:46,224 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:25:46,240 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-12-02 08:25:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:46,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:25:46,279 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1530 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1530) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-12-02 08:25:46,317 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1529 (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$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1529))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1530)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-12-02 08:25:46,322 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1529 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1529))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1530)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-12-02 08:25:46,341 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1533 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1529 (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$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1533))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1529)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1530)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-12-02 08:25:46,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026791181] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:25:46,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:25:46,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-12-02 08:25:46,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931619932] [2024-12-02 08:25:46,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 08:25:46,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-12-02 08:25:46,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:46,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-12-02 08:25:46,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=506, Unknown=11, NotChecked=196, Total=812 [2024-12-02 08:25:46,344 INFO L87 Difference]: Start difference. First operand 1385 states and 1743 transitions. Second operand has 24 states, 21 states have (on average 7.666666666666667) internal successors, (161), 23 states have internal predecessors, (161), 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-12-02 08:25:48,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:48,386 INFO L93 Difference]: Finished difference Result 1387 states and 1747 transitions. [2024-12-02 08:25:48,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 08:25:48,387 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.666666666666667) internal successors, (161), 23 states have internal predecessors, (161), 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 101 [2024-12-02 08:25:48,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:48,390 INFO L225 Difference]: With dead ends: 1387 [2024-12-02 08:25:48,390 INFO L226 Difference]: Without dead ends: 1387 [2024-12-02 08:25:48,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=640, Unknown=11, NotChecked=220, Total=992 [2024-12-02 08:25:48,390 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 690 mSDsluCounter, 6327 mSDsCounter, 0 mSdLazyCounter, 4318 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 6827 SdHoareTripleChecker+Invalid, 4330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 4318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:48,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 6827 Invalid, 4330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 4318 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-12-02 08:25:48,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2024-12-02 08:25:48,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1384. [2024-12-02 08:25:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1143 states have (on average 1.5126859142607174) internal successors, (1729), 1374 states have internal predecessors, (1729), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-12-02 08:25:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1741 transitions. [2024-12-02 08:25:48,405 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1741 transitions. Word has length 101 [2024-12-02 08:25:48,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:48,405 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1741 transitions. [2024-12-02 08:25:48,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.666666666666667) internal successors, (161), 23 states have internal predecessors, (161), 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-12-02 08:25:48,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1741 transitions. [2024-12-02 08:25:48,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-02 08:25:48,406 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:48,406 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] [2024-12-02 08:25:48,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 08:25:48,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-12-02 08:25:48,607 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:48,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:48,607 INFO L85 PathProgramCache]: Analyzing trace with hash -230371712, now seen corresponding path program 1 times [2024-12-02 08:25:48,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:48,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643371933] [2024-12-02 08:25:48,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:48,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:49,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643371933] [2024-12-02 08:25:49,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643371933] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:25:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690456611] [2024-12-02 08:25:49,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:49,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:25:49,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:25:49,200 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:25:49,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 08:25:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:49,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-12-02 08:25:49,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:25:49,396 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-12-02 08:25:49,466 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-12-02 08:25:49,471 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 08:25:49,471 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-12-02 08:25:49,482 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-12-02 08:25:49,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-12-02 08:25:49,528 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-12-02 08:25:49,530 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-12-02 08:25:49,599 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:25:49,599 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:25:49,605 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-12-02 08:25:49,654 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:25:49,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 62 treesize of output 57 [2024-12-02 08:25:49,661 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-12-02 08:25:49,700 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:25:49,700 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:25:49,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 08:25:49,717 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-12-02 08:25:49,720 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-12-02 08:25:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:49,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:25:49,762 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1698 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))))) is different from false [2024-12-02 08:25:49,771 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1699) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1698 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2024-12-02 08:25:49,785 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1696) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1697) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1697))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1696) .cse1 v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1699) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-12-02 08:25:49,800 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1697))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1696) .cse1 v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1699) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1696) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1697) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2024-12-02 08:25:49,846 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1705 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1705))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1704) .cse0 v_ArrVal_1696) (select (select (store .cse1 .cse0 v_ArrVal_1697) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1698))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1705 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1705))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1697))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1704) .cse3 v_ArrVal_1696) .cse4 v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1699) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-12-02 08:25:49,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690456611] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:25:49,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:25:49,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2024-12-02 08:25:49,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761612744] [2024-12-02 08:25:49,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 08:25:49,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 08:25:49,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:49,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 08:25:49,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=355, Unknown=5, NotChecked=210, Total=650 [2024-12-02 08:25:49,850 INFO L87 Difference]: Start difference. First operand 1384 states and 1741 transitions. Second operand has 19 states, 16 states have (on average 9.5625) internal successors, (153), 19 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 08:25:52,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:52,232 INFO L93 Difference]: Finished difference Result 1386 states and 1745 transitions. [2024-12-02 08:25:52,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 08:25:52,233 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.5625) internal successors, (153), 19 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 101 [2024-12-02 08:25:52,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:52,235 INFO L225 Difference]: With dead ends: 1386 [2024-12-02 08:25:52,235 INFO L226 Difference]: Without dead ends: 1386 [2024-12-02 08:25:52,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=591, Unknown=5, NotChecked=270, Total=992 [2024-12-02 08:25:52,236 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 699 mSDsluCounter, 4579 mSDsCounter, 0 mSdLazyCounter, 4401 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 5082 SdHoareTripleChecker+Invalid, 4414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:52,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 5082 Invalid, 4414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4401 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-12-02 08:25:52,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-12-02 08:25:52,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1362. [2024-12-02 08:25:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1123 states have (on average 1.5191451469278718) internal successors, (1706), 1354 states have internal predecessors, (1706), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:25:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1716 transitions. [2024-12-02 08:25:52,245 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1716 transitions. Word has length 101 [2024-12-02 08:25:52,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:52,245 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1716 transitions. [2024-12-02 08:25:52,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.5625) internal successors, (153), 19 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 08:25:52,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1716 transitions. [2024-12-02 08:25:52,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-02 08:25:52,246 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:52,246 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-12-02 08:25:52,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 08:25:52,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:25:52,446 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:52,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:52,447 INFO L85 PathProgramCache]: Analyzing trace with hash -632821940, now seen corresponding path program 1 times [2024-12-02 08:25:52,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:52,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751141876] [2024-12-02 08:25:52,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:52,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:52,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:52,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:52,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751141876] [2024-12-02 08:25:52,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751141876] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:52,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:52,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-12-02 08:25:52,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128516936] [2024-12-02 08:25:52,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:52,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 08:25:52,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:52,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 08:25:52,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-12-02 08:25:52,905 INFO L87 Difference]: Start difference. First operand 1362 states and 1716 transitions. Second operand has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 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-12-02 08:25:54,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:54,228 INFO L93 Difference]: Finished difference Result 1393 states and 1753 transitions. [2024-12-02 08:25:54,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 08:25:54,228 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 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-12-02 08:25:54,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:54,230 INFO L225 Difference]: With dead ends: 1393 [2024-12-02 08:25:54,230 INFO L226 Difference]: Without dead ends: 1393 [2024-12-02 08:25:54,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-12-02 08:25:54,230 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 741 mSDsluCounter, 4417 mSDsCounter, 0 mSdLazyCounter, 3040 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 4920 SdHoareTripleChecker+Invalid, 3053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:54,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 4920 Invalid, 3053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3040 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-12-02 08:25:54,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-12-02 08:25:54,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1389. [2024-12-02 08:25:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1149 states have (on average 1.5100087032201914) internal successors, (1735), 1379 states have internal predecessors, (1735), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-12-02 08:25:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1747 transitions. [2024-12-02 08:25:54,241 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1747 transitions. Word has length 103 [2024-12-02 08:25:54,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:54,241 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 1747 transitions. [2024-12-02 08:25:54,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 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-12-02 08:25:54,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1747 transitions. [2024-12-02 08:25:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-02 08:25:54,241 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:54,241 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-12-02 08:25:54,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-02 08:25:54,242 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:54,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:54,242 INFO L85 PathProgramCache]: Analyzing trace with hash -632821939, now seen corresponding path program 1 times [2024-12-02 08:25:54,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:54,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555762310] [2024-12-02 08:25:54,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:54,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:54,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:54,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555762310] [2024-12-02 08:25:54,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555762310] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:25:54,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:25:54,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-12-02 08:25:54,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039045756] [2024-12-02 08:25:54,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:25:54,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 08:25:54,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:54,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 08:25:54,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-12-02 08:25:54,909 INFO L87 Difference]: Start difference. First operand 1389 states and 1747 transitions. Second operand has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 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-12-02 08:25:56,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:56,129 INFO L93 Difference]: Finished difference Result 1392 states and 1751 transitions. [2024-12-02 08:25:56,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 08:25:56,129 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 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-12-02 08:25:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:56,131 INFO L225 Difference]: With dead ends: 1392 [2024-12-02 08:25:56,131 INFO L226 Difference]: Without dead ends: 1392 [2024-12-02 08:25:56,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-12-02 08:25:56,131 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 734 mSDsluCounter, 2503 mSDsCounter, 0 mSdLazyCounter, 2608 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 3007 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:56,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 3007 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2608 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-02 08:25:56,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2024-12-02 08:25:56,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1389. [2024-12-02 08:25:56,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1149 states have (on average 1.5082680591818973) internal successors, (1733), 1379 states have internal predecessors, (1733), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-12-02 08:25:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1745 transitions. [2024-12-02 08:25:56,143 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1745 transitions. Word has length 103 [2024-12-02 08:25:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:56,143 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 1745 transitions. [2024-12-02 08:25:56,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 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-12-02 08:25:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1745 transitions. [2024-12-02 08:25:56,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-02 08:25:56,144 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:56,144 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-12-02 08:25:56,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-02 08:25:56,144 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:56,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:56,144 INFO L85 PathProgramCache]: Analyzing trace with hash 354693433, now seen corresponding path program 1 times [2024-12-02 08:25:56,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:56,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478068277] [2024-12-02 08:25:56,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:56,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:56,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:56,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:25:56,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478068277] [2024-12-02 08:25:56,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478068277] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:25:56,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148932828] [2024-12-02 08:25:56,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:56,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:25:56,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:25:56,640 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:25:56,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 08:25:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:25:56,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-12-02 08:25:56,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:25:56,862 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-12-02 08:25:56,955 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-12-02 08:25:56,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-12-02 08:25:56,976 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-12-02 08:25:57,041 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-12-02 08:25:57,150 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:25:57,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 08:25:57,229 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:25:57,229 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:25:57,278 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:25:57,278 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:25:57,333 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:25:57,334 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:25:57,347 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-12-02 08:25:57,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:25:57,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:25:57,422 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2036 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2036) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-12-02 08:25:57,493 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (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$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2034))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2035)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2036)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-12-02 08:25:57,498 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2034))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2035)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2036)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-12-02 08:25:57,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148932828] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:25:57,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:25:57,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-12-02 08:25:57,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78756673] [2024-12-02 08:25:57,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 08:25:57,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-12-02 08:25:57,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:25:57,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-12-02 08:25:57,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=708, Unknown=51, NotChecked=174, Total=1056 [2024-12-02 08:25:57,570 INFO L87 Difference]: Start difference. First operand 1389 states and 1745 transitions. Second operand has 26 states, 23 states have (on average 7.260869565217392) internal successors, (167), 25 states have internal predecessors, (167), 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-12-02 08:25:59,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:25:59,564 INFO L93 Difference]: Finished difference Result 1391 states and 1749 transitions. [2024-12-02 08:25:59,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 08:25:59,564 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.260869565217392) internal successors, (167), 25 states have internal predecessors, (167), 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-12-02 08:25:59,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:25:59,565 INFO L225 Difference]: With dead ends: 1391 [2024-12-02 08:25:59,565 INFO L226 Difference]: Without dead ends: 1391 [2024-12-02 08:25:59,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=870, Unknown=53, NotChecked=192, Total=1260 [2024-12-02 08:25:59,566 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 687 mSDsluCounter, 6335 mSDsCounter, 0 mSdLazyCounter, 4290 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 6834 SdHoareTripleChecker+Invalid, 4303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-12-02 08:25:59,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 6834 Invalid, 4303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4290 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-12-02 08:25:59,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2024-12-02 08:25:59,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1388. [2024-12-02 08:25:59,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1149 states have (on average 1.5065274151436032) internal successors, (1731), 1378 states have internal predecessors, (1731), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-12-02 08:25:59,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1743 transitions. [2024-12-02 08:25:59,575 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1743 transitions. Word has length 104 [2024-12-02 08:25:59,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:25:59,575 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1743 transitions. [2024-12-02 08:25:59,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.260869565217392) internal successors, (167), 25 states have internal predecessors, (167), 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-12-02 08:25:59,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1743 transitions. [2024-12-02 08:25:59,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-02 08:25:59,576 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:25:59,576 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-12-02 08:25:59,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 08:25:59,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-12-02 08:25:59,776 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:25:59,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:25:59,777 INFO L85 PathProgramCache]: Analyzing trace with hash 354693434, now seen corresponding path program 1 times [2024-12-02 08:25:59,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:25:59,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860946826] [2024-12-02 08:25:59,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:25:59,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:25:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:26:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:26:00,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:26:00,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860946826] [2024-12-02 08:26:00,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860946826] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:26:00,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428076434] [2024-12-02 08:26:00,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:26:00,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:26:00,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:26:00,549 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:26:00,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 08:26:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:26:00,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-12-02 08:26:00,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:26:00,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-12-02 08:26:00,842 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 08:26:00,842 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-12-02 08:26:00,847 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-12-02 08:26:00,853 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-12-02 08:26:00,856 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-12-02 08:26:00,909 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-12-02 08:26:00,912 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-12-02 08:26:00,985 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:26:00,986 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:26:00,989 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-12-02 08:26:01,050 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:26:01,050 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:26:01,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 08:26:01,113 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:26:01,113 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:26:01,120 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-12-02 08:26:01,170 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:26:01,170 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:26:01,176 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-12-02 08:26:01,190 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-12-02 08:26:01,193 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-12-02 08:26:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:26:01,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:26:01,242 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2219 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-12-02 08:26:01,298 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2217) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2218))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2217) .cse1 v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-12-02 08:26:01,311 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2218))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2217) .cse1 v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2217) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-12-02 08:26:01,332 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2215))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2218))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2216) .cse0 v_ArrVal_2217) .cse1 v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2215 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2215))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2216) .cse5 v_ArrVal_2217) (select (select (store .cse6 .cse5 v_ArrVal_2218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2219))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-12-02 08:26:01,558 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2226))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2215))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2218))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2225) .cse0 v_ArrVal_2216) .cse1 v_ArrVal_2217) .cse2 v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2225 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2226))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2215))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2225) .cse7 v_ArrVal_2216) .cse8 v_ArrVal_2217) (select (select (store .cse9 .cse8 v_ArrVal_2218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2219))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2024-12-02 08:26:01,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428076434] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:26:01,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:26:01,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2024-12-02 08:26:01,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720947755] [2024-12-02 08:26:01,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 08:26:01,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-12-02 08:26:01,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:26:01,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-12-02 08:26:01,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=485, Unknown=24, NotChecked=250, Total=870 [2024-12-02 08:26:01,562 INFO L87 Difference]: Start difference. First operand 1388 states and 1743 transitions. Second operand has 21 states, 18 states have (on average 8.777777777777779) internal successors, (158), 21 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 08:26:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:26:03,248 INFO L93 Difference]: Finished difference Result 1390 states and 1747 transitions. [2024-12-02 08:26:03,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 08:26:03,249 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.777777777777779) internal successors, (158), 21 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2024-12-02 08:26:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:26:03,250 INFO L225 Difference]: With dead ends: 1390 [2024-12-02 08:26:03,250 INFO L226 Difference]: Without dead ends: 1390 [2024-12-02 08:26:03,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=810, Unknown=24, NotChecked=320, Total=1332 [2024-12-02 08:26:03,251 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 696 mSDsluCounter, 2882 mSDsCounter, 0 mSdLazyCounter, 3023 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 3384 SdHoareTripleChecker+Invalid, 3041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-12-02 08:26:03,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 3384 Invalid, 3041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3023 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-12-02 08:26:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-12-02 08:26:03,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1360. [2024-12-02 08:26:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1123 states have (on average 1.5155832591273375) internal successors, (1702), 1352 states have internal predecessors, (1702), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:26:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1712 transitions. [2024-12-02 08:26:03,259 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1712 transitions. Word has length 104 [2024-12-02 08:26:03,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:26:03,260 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 1712 transitions. [2024-12-02 08:26:03,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.777777777777779) internal successors, (158), 21 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 08:26:03,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1712 transitions. [2024-12-02 08:26:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-02 08:26:03,260 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:26:03,260 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-12-02 08:26:03,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 08:26:03,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-12-02 08:26:03,461 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:26:03,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:26:03,461 INFO L85 PathProgramCache]: Analyzing trace with hash 459615374, now seen corresponding path program 1 times [2024-12-02 08:26:03,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:26:03,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843240688] [2024-12-02 08:26:03,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:26:03,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:26:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:26:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:26:04,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:26:04,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843240688] [2024-12-02 08:26:04,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843240688] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:26:04,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:26:04,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-12-02 08:26:04,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229576200] [2024-12-02 08:26:04,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:26:04,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-12-02 08:26:04,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:26:04,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-12-02 08:26:04,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-12-02 08:26:04,089 INFO L87 Difference]: Start difference. First operand 1360 states and 1712 transitions. Second operand has 17 states, 15 states have (on average 7.0) internal successors, (105), 16 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-12-02 08:26:05,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:26:05,798 INFO L93 Difference]: Finished difference Result 1399 states and 1757 transitions. [2024-12-02 08:26:05,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 08:26:05,799 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.0) internal successors, (105), 16 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-12-02 08:26:05,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:26:05,800 INFO L225 Difference]: With dead ends: 1399 [2024-12-02 08:26:05,800 INFO L226 Difference]: Without dead ends: 1399 [2024-12-02 08:26:05,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2024-12-02 08:26:05,801 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 726 mSDsluCounter, 4852 mSDsCounter, 0 mSdLazyCounter, 3387 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 5351 SdHoareTripleChecker+Invalid, 3403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:26:05,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 5351 Invalid, 3403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3387 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-12-02 08:26:05,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2024-12-02 08:26:05,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1395. [2024-12-02 08:26:05,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1157 states have (on average 1.5030250648228176) internal successors, (1739), 1385 states have internal predecessors, (1739), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-12-02 08:26:05,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1751 transitions. [2024-12-02 08:26:05,811 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1751 transitions. Word has length 107 [2024-12-02 08:26:05,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:26:05,811 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 1751 transitions. [2024-12-02 08:26:05,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.0) internal successors, (105), 16 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-12-02 08:26:05,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1751 transitions. [2024-12-02 08:26:05,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-02 08:26:05,811 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:26:05,811 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-12-02 08:26:05,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-12-02 08:26:05,811 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:26:05,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:26:05,812 INFO L85 PathProgramCache]: Analyzing trace with hash 459615375, now seen corresponding path program 1 times [2024-12-02 08:26:05,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:26:05,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316625130] [2024-12-02 08:26:05,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:26:05,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:26:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:26:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:26:06,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:26:06,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316625130] [2024-12-02 08:26:06,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316625130] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:26:06,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:26:06,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-12-02 08:26:06,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385084463] [2024-12-02 08:26:06,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:26:06,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-12-02 08:26:06,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:26:06,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-12-02 08:26:06,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-12-02 08:26:06,714 INFO L87 Difference]: Start difference. First operand 1395 states and 1751 transitions. Second operand has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 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-12-02 08:26:08,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:26:08,726 INFO L93 Difference]: Finished difference Result 1398 states and 1755 transitions. [2024-12-02 08:26:08,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 08:26:08,726 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 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-12-02 08:26:08,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:26:08,728 INFO L225 Difference]: With dead ends: 1398 [2024-12-02 08:26:08,728 INFO L226 Difference]: Without dead ends: 1398 [2024-12-02 08:26:08,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-12-02 08:26:08,729 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 739 mSDsluCounter, 3701 mSDsCounter, 0 mSdLazyCounter, 3735 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 4201 SdHoareTripleChecker+Invalid, 3753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-12-02 08:26:08,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 4201 Invalid, 3753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3735 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-12-02 08:26:08,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-12-02 08:26:08,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1395. [2024-12-02 08:26:08,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1157 states have (on average 1.501296456352636) internal successors, (1737), 1385 states have internal predecessors, (1737), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-12-02 08:26:08,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1749 transitions. [2024-12-02 08:26:08,739 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1749 transitions. Word has length 107 [2024-12-02 08:26:08,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:26:08,739 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 1749 transitions. [2024-12-02 08:26:08,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 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-12-02 08:26:08,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1749 transitions. [2024-12-02 08:26:08,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-02 08:26:08,739 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:26:08,739 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] [2024-12-02 08:26:08,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-12-02 08:26:08,739 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:26:08,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:26:08,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1711228933, now seen corresponding path program 1 times [2024-12-02 08:26:08,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:26:08,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276004642] [2024-12-02 08:26:08,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:26:08,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:26:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:26:09,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:26:09,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:26:09,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276004642] [2024-12-02 08:26:09,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276004642] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:26:09,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420436914] [2024-12-02 08:26:09,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:26:09,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:26:09,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:26:09,342 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:26:09,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 08:26:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:26:09,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-12-02 08:26:09,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:26:09,611 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-12-02 08:26:09,703 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-12-02 08:26:09,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-12-02 08:26:09,733 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-12-02 08:26:09,810 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-12-02 08:26:09,932 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:26:09,932 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:26:10,008 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:26:10,009 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:26:10,058 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:26:10,058 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:26:10,109 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:26:10,109 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:26:10,166 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:26:10,166 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:26:10,179 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-12-02 08:26:10,232 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-12-02 08:26:10,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-12-02 08:26:10,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:26:10,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:26:10,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420436914] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:26:10,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:26:10,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2024-12-02 08:26:10,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023919927] [2024-12-02 08:26:10,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 08:26:10,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-12-02 08:26:10,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:26:10,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-12-02 08:26:10,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1089, Unknown=54, NotChecked=0, Total=1332 [2024-12-02 08:26:10,934 INFO L87 Difference]: Start difference. First operand 1395 states and 1749 transitions. Second operand has 26 states, 23 states have (on average 7.608695652173913) internal successors, (175), 26 states have internal predecessors, (175), 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-12-02 08:26:13,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:26:13,381 INFO L93 Difference]: Finished difference Result 1397 states and 1753 transitions. [2024-12-02 08:26:13,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 08:26:13,381 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.608695652173913) internal successors, (175), 26 states have internal predecessors, (175), 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 108 [2024-12-02 08:26:13,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:26:13,383 INFO L225 Difference]: With dead ends: 1397 [2024-12-02 08:26:13,383 INFO L226 Difference]: Without dead ends: 1397 [2024-12-02 08:26:13,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=1149, Unknown=54, NotChecked=0, Total=1406 [2024-12-02 08:26:13,384 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 674 mSDsluCounter, 7265 mSDsCounter, 0 mSdLazyCounter, 4898 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 7766 SdHoareTripleChecker+Invalid, 4911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-12-02 08:26:13,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 7766 Invalid, 4911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4898 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-12-02 08:26:13,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2024-12-02 08:26:13,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1394. [2024-12-02 08:26:13,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1157 states have (on average 1.4995678478824546) internal successors, (1735), 1384 states have internal predecessors, (1735), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-12-02 08:26:13,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1747 transitions. [2024-12-02 08:26:13,396 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1747 transitions. Word has length 108 [2024-12-02 08:26:13,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:26:13,396 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1747 transitions. [2024-12-02 08:26:13,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.608695652173913) internal successors, (175), 26 states have internal predecessors, (175), 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-12-02 08:26:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1747 transitions. [2024-12-02 08:26:13,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-02 08:26:13,397 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:26:13,397 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] [2024-12-02 08:26:13,403 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 08:26:13,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-12-02 08:26:13,597 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:26:13,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:26:13,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1711228932, now seen corresponding path program 1 times [2024-12-02 08:26:13,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:26:13,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773151784] [2024-12-02 08:26:13,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:26:13,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:26:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:26:14,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:26:14,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:26:14,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773151784] [2024-12-02 08:26:14,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773151784] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:26:14,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612349375] [2024-12-02 08:26:14,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:26:14,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:26:14,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:26:14,668 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:26:14,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 08:26:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:26:14,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-12-02 08:26:14,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:26:14,911 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-12-02 08:26:14,991 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-12-02 08:26:15,003 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-12-02 08:26:15,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-12-02 08:26:15,049 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-12-02 08:26:15,054 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-12-02 08:26:15,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-12-02 08:26:15,172 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-12-02 08:26:15,323 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:26:15,323 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:26:15,330 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-12-02 08:26:15,459 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:26:15,459 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:26:15,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 08:26:15,560 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:26:15,560 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:26:15,568 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-12-02 08:26:15,661 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:26:15,661 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:26:15,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-12-02 08:26:15,758 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:26:15,758 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:26:15,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 08:26:15,794 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-12-02 08:26:15,800 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-12-02 08:26:15,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 08:26:15,859 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-12-02 08:26:15,873 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-12-02 08:26:15,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-12-02 08:26:15,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:26:15,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:26:33,983 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2788 (Array Int Int)) (v_ArrVal_2787 (Array Int Int)) (v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2791 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2800))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2787))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2788))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2799) .cse0 v_ArrVal_2786) .cse1 v_ArrVal_2789) .cse2 v_ArrVal_2790) (select (select (store .cse3 .cse2 v_ArrVal_2791) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2793))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2788 (Array Int Int)) (v_ArrVal_2787 (Array Int Int)) (v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2792 (Array Int Int)) (v_ArrVal_2791 (Array Int Int)) (v_ArrVal_2790 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2794 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2800))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2787))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2788))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2791))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2799) .cse7 v_ArrVal_2786) .cse8 v_ArrVal_2789) .cse9 v_ArrVal_2790) .cse10 v_ArrVal_2793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2794) (select (select (store .cse11 .cse10 v_ArrVal_2792) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2024-12-02 08:26:33,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612349375] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:26:33,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:26:33,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 28 [2024-12-02 08:26:33,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9156737] [2024-12-02 08:26:33,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 08:26:33,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-12-02 08:26:33,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:26:33,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-12-02 08:26:33,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1301, Unknown=61, NotChecked=76, Total=1640 [2024-12-02 08:26:33,992 INFO L87 Difference]: Start difference. First operand 1394 states and 1747 transitions. Second operand has 29 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 28 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 08:27:02,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:27:02,059 INFO L93 Difference]: Finished difference Result 1396 states and 1751 transitions. [2024-12-02 08:27:02,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 08:27:02,060 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 28 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2024-12-02 08:27:02,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:27:02,061 INFO L225 Difference]: With dead ends: 1396 [2024-12-02 08:27:02,061 INFO L226 Difference]: Without dead ends: 1396 [2024-12-02 08:27:02,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=246, Invalid=1586, Unknown=64, NotChecked=84, Total=1980 [2024-12-02 08:27:02,062 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 676 mSDsluCounter, 6177 mSDsCounter, 0 mSdLazyCounter, 6013 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 6675 SdHoareTripleChecker+Invalid, 6027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 6013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.1s IncrementalHoareTripleChecker+Time [2024-12-02 08:27:02,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 6675 Invalid, 6027 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 6013 Invalid, 0 Unknown, 0 Unchecked, 27.1s Time] [2024-12-02 08:27:02,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2024-12-02 08:27:02,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1358. [2024-12-02 08:27:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1123 states have (on average 1.5120213713268031) internal successors, (1698), 1350 states have internal predecessors, (1698), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:27:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1708 transitions. [2024-12-02 08:27:02,072 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1708 transitions. Word has length 108 [2024-12-02 08:27:02,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:27:02,072 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1708 transitions. [2024-12-02 08:27:02,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 28 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 08:27:02,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1708 transitions. [2024-12-02 08:27:02,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-02 08:27:02,072 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:27:02,073 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-12-02 08:27:02,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 08:27:02,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-12-02 08:27:02,273 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:27:02,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:27:02,273 INFO L85 PathProgramCache]: Analyzing trace with hash 46538489, now seen corresponding path program 1 times [2024-12-02 08:27:02,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:27:02,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016923943] [2024-12-02 08:27:02,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:27:02,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:27:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:27:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:27:02,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:27:02,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016923943] [2024-12-02 08:27:02,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016923943] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:27:02,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:27:02,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 08:27:02,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725060776] [2024-12-02 08:27:02,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:27:02,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 08:27:02,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:27:02,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 08:27:02,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 08:27:02,871 INFO L87 Difference]: Start difference. First operand 1358 states and 1708 transitions. Second operand has 7 states, 6 states have (on average 18.0) internal successors, (108), 7 states have internal predecessors, (108), 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-12-02 08:27:08,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:27:08,231 INFO L93 Difference]: Finished difference Result 1357 states and 1706 transitions. [2024-12-02 08:27:08,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 08:27:08,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 18.0) internal successors, (108), 7 states have internal predecessors, (108), 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-12-02 08:27:08,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:27:08,233 INFO L225 Difference]: With dead ends: 1357 [2024-12-02 08:27:08,233 INFO L226 Difference]: Without dead ends: 1357 [2024-12-02 08:27:08,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:27:08,234 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 2 mSDsluCounter, 2790 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3573 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-12-02 08:27:08,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3573 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-12-02 08:27:08,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2024-12-02 08:27:08,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1357. [2024-12-02 08:27:08,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1123 states have (on average 1.510240427426536) internal successors, (1696), 1349 states have internal predecessors, (1696), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:27:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1706 transitions. [2024-12-02 08:27:08,245 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1706 transitions. Word has length 110 [2024-12-02 08:27:08,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:27:08,245 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 1706 transitions. [2024-12-02 08:27:08,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 18.0) internal successors, (108), 7 states have internal predecessors, (108), 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-12-02 08:27:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1706 transitions. [2024-12-02 08:27:08,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-02 08:27:08,246 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:27:08,246 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-12-02 08:27:08,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-12-02 08:27:08,246 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:27:08,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:27:08,247 INFO L85 PathProgramCache]: Analyzing trace with hash 46538490, now seen corresponding path program 1 times [2024-12-02 08:27:08,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:27:08,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94928057] [2024-12-02 08:27:08,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:27:08,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:27:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:27:11,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:27:11,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:27:11,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94928057] [2024-12-02 08:27:11,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94928057] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:27:11,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:27:11,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-12-02 08:27:11,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237839032] [2024-12-02 08:27:11,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:27:11,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 08:27:11,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:27:11,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 08:27:11,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-12-02 08:27:11,576 INFO L87 Difference]: Start difference. First operand 1357 states and 1706 transitions. Second operand has 19 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 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-12-02 08:27:22,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:27:22,879 INFO L93 Difference]: Finished difference Result 1401 states and 1755 transitions. [2024-12-02 08:27:22,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 08:27:22,879 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 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-12-02 08:27:22,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:27:22,880 INFO L225 Difference]: With dead ends: 1401 [2024-12-02 08:27:22,881 INFO L226 Difference]: Without dead ends: 1401 [2024-12-02 08:27:22,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-12-02 08:27:22,881 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 735 mSDsluCounter, 2146 mSDsCounter, 0 mSdLazyCounter, 2257 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:27:22,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 2645 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2257 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2024-12-02 08:27:22,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2024-12-02 08:27:22,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1398. [2024-12-02 08:27:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1163 states have (on average 1.4935511607910577) internal successors, (1737), 1388 states have internal predecessors, (1737), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-12-02 08:27:22,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1749 transitions. [2024-12-02 08:27:22,892 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1749 transitions. Word has length 110 [2024-12-02 08:27:22,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:27:22,892 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 1749 transitions. [2024-12-02 08:27:22,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 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-12-02 08:27:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1749 transitions. [2024-12-02 08:27:22,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-02 08:27:22,892 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:27:22,892 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] [2024-12-02 08:27:22,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-12-02 08:27:22,893 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:27:22,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:27:22,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2041331821, now seen corresponding path program 1 times [2024-12-02 08:27:22,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:27:22,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547728545] [2024-12-02 08:27:22,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:27:22,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:27:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:27:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:27:25,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:27:25,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547728545] [2024-12-02 08:27:25,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547728545] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:27:25,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395890342] [2024-12-02 08:27:25,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:27:25,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:27:25,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:27:25,994 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:27:25,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 08:27:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:27:26,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-12-02 08:27:26,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:27:26,279 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-12-02 08:27:26,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-02 08:27:27,023 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-12-02 08:27:27,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-12-02 08:27:27,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 08:27:27,281 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-12-02 08:27:27,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-12-02 08:27:27,905 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-12-02 08:27:28,723 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:27:28,723 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:27:28,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-12-02 08:27:29,325 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:27:29,326 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:27:29,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 08:27:29,788 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:27:29,788 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:27:29,820 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-12-02 08:27:30,249 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:27:30,249 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:27:30,262 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-12-02 08:27:30,724 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:27:30,724 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:27:30,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-12-02 08:27:31,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 08:27:31,175 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 20 treesize of output 15 [2024-12-02 08:27:31,268 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-12-02 08:27:31,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-12-02 08:27:31,443 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:27:31,443 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:27:31,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 08:27:31,532 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-12-02 08:27:31,544 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-12-02 08:27:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:27:31,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:27:31,931 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int))) (<= (+ 44 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3198 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-12-02 08:27:33,090 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (or (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (<= 0 (+ 40 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3194) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3195 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3194 (Array Int Int))) (or (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3195))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 44 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3194) .cse2 v_ArrVal_3198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3196) (select (select (store .cse3 .cse2 v_ArrVal_3197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))))))) is different from false [2024-12-02 08:27:34,264 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3190))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3192))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3191) .cse0 v_ArrVal_3193) .cse1 v_ArrVal_3194) (select (select (store .cse2 .cse1 v_ArrVal_3195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3198))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 40))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3195 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)) (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3190))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_3192))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3195))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3191) .cse5 v_ArrVal_3193) .cse6 v_ArrVal_3194) .cse7 v_ArrVal_3198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3196) (select (select (store .cse8 .cse7 v_ArrVal_3197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-12-02 08:27:34,338 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3190))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3192))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3191) .cse1 v_ArrVal_3193) .cse2 v_ArrVal_3194) (select (select (store .cse3 .cse2 v_ArrVal_3195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3198))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3195 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (or (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3190))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_3192))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3195))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 44 (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3191) .cse6 v_ArrVal_3193) .cse7 v_ArrVal_3194) .cse8 v_ArrVal_3198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3196) (select (select (store .cse9 .cse8 v_ArrVal_3197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))))))) is different from false [2024-12-02 08:27:34,482 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))) (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3188 (Array Int Int)) (v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3188))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3190))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3192))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3189) .cse0 v_ArrVal_3191) .cse1 v_ArrVal_3193) .cse2 v_ArrVal_3194) (select (select (store .cse3 .cse2 v_ArrVal_3195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3198))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) (forall ((v_ArrVal_3195 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3188 (Array Int Int)) (v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (or (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3188))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_3190))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_3192))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3195))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3189) .cse7 v_ArrVal_3191) .cse8 v_ArrVal_3193) .cse9 v_ArrVal_3194) .cse10 v_ArrVal_3198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3196) (select (select (store .cse11 .cse10 v_ArrVal_3197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))) is different from false [2024-12-02 08:27:34,557 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (or (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3188 (Array Int Int)) (v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3188))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3190))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3192))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3189) .cse1 v_ArrVal_3191) .cse2 v_ArrVal_3193) .cse3 v_ArrVal_3194) (select (select (store .cse4 .cse3 v_ArrVal_3195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3198))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3195 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3188 (Array Int Int)) (v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)) (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3188))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_3190))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_3192))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3195))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ 44 (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3189) .cse8 v_ArrVal_3191) .cse9 v_ArrVal_3193) .cse10 v_ArrVal_3194) .cse11 v_ArrVal_3198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3196) (select (select (store .cse12 .cse11 v_ArrVal_3197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))))))))) is different from false [2024-12-02 08:27:34,863 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3188 (Array Int Int)) (v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3203 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3204))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_3188))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3190))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3192))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3203) .cse0 v_ArrVal_3189) .cse1 v_ArrVal_3191) .cse2 v_ArrVal_3193) .cse3 v_ArrVal_3194) (select (select (store .cse4 .cse3 v_ArrVal_3195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3198))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3195 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3188 (Array Int Int)) (v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3203 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (or (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3204))) (let ((.cse9 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse9 v_ArrVal_3188))) (let ((.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse10 v_ArrVal_3190))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_3192))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_3195))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ 44 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3203) .cse9 v_ArrVal_3189) .cse10 v_ArrVal_3191) .cse11 v_ArrVal_3193) .cse12 v_ArrVal_3194) .cse13 v_ArrVal_3198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3196) (select (select (store .cse14 .cse13 v_ArrVal_3197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))) is different from false [2024-12-02 08:27:34,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395890342] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:27:34,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:27:34,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 29 [2024-12-02 08:27:34,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558407034] [2024-12-02 08:27:34,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 08:27:34,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-12-02 08:27:34,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:27:34,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-12-02 08:27:34,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1135, Unknown=18, NotChecked=532, Total=1892 [2024-12-02 08:27:34,872 INFO L87 Difference]: Start difference. First operand 1398 states and 1749 transitions. Second operand has 30 states, 27 states have (on average 6.666666666666667) internal successors, (180), 29 states have internal predecessors, (180), 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-12-02 08:27:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:27:53,995 INFO L93 Difference]: Finished difference Result 1400 states and 1753 transitions. [2024-12-02 08:27:53,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-12-02 08:27:53,996 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 6.666666666666667) internal successors, (180), 29 states have internal predecessors, (180), 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 111 [2024-12-02 08:27:53,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:27:53,998 INFO L225 Difference]: With dead ends: 1400 [2024-12-02 08:27:53,998 INFO L226 Difference]: Without dead ends: 1400 [2024-12-02 08:27:53,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=231, Invalid=1339, Unknown=18, NotChecked=574, Total=2162 [2024-12-02 08:27:53,999 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 678 mSDsluCounter, 4213 mSDsCounter, 0 mSdLazyCounter, 4103 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 4710 SdHoareTripleChecker+Invalid, 4122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:27:53,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 4710 Invalid, 4122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4103 Invalid, 0 Unknown, 0 Unchecked, 18.6s Time] [2024-12-02 08:27:54,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2024-12-02 08:27:54,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1356. [2024-12-02 08:27:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1123 states have (on average 1.508459483526269) internal successors, (1694), 1348 states have internal predecessors, (1694), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:27:54,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1704 transitions. [2024-12-02 08:27:54,014 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1704 transitions. Word has length 111 [2024-12-02 08:27:54,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:27:54,014 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1704 transitions. [2024-12-02 08:27:54,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 6.666666666666667) internal successors, (180), 29 states have internal predecessors, (180), 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-12-02 08:27:54,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1704 transitions. [2024-12-02 08:27:54,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-02 08:27:54,015 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:27:54,015 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-12-02 08:27:54,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-02 08:27:54,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:27:54,216 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:27:54,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:27:54,216 INFO L85 PathProgramCache]: Analyzing trace with hash -845632555, now seen corresponding path program 1 times [2024-12-02 08:27:54,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:27:54,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863469038] [2024-12-02 08:27:54,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:27:54,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:27:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:27:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:27:55,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:27:55,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863469038] [2024-12-02 08:27:55,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863469038] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:27:55,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:27:55,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 08:27:55,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074656712] [2024-12-02 08:27:55,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:27:55,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 08:27:55,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:27:55,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 08:27:55,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-12-02 08:27:55,781 INFO L87 Difference]: Start difference. First operand 1356 states and 1704 transitions. Second operand has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 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-12-02 08:28:04,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:28:04,642 INFO L93 Difference]: Finished difference Result 1355 states and 1702 transitions. [2024-12-02 08:28:04,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 08:28:04,643 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 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-12-02 08:28:04,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:28:04,644 INFO L225 Difference]: With dead ends: 1355 [2024-12-02 08:28:04,644 INFO L226 Difference]: Without dead ends: 1355 [2024-12-02 08:28:04,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-12-02 08:28:04,644 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 748 mSDsluCounter, 2436 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 2936 SdHoareTripleChecker+Invalid, 1865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-12-02 08:28:04,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 2936 Invalid, 1865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1856 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2024-12-02 08:28:04,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2024-12-02 08:28:04,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1355. [2024-12-02 08:28:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1123 states have (on average 1.5066785396260018) internal successors, (1692), 1347 states have internal predecessors, (1692), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:28:04,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1702 transitions. [2024-12-02 08:28:04,651 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1702 transitions. Word has length 113 [2024-12-02 08:28:04,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:28:04,652 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 1702 transitions. [2024-12-02 08:28:04,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 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-12-02 08:28:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1702 transitions. [2024-12-02 08:28:04,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-02 08:28:04,652 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:28:04,652 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-12-02 08:28:04,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-12-02 08:28:04,652 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:28:04,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:28:04,653 INFO L85 PathProgramCache]: Analyzing trace with hash -845632554, now seen corresponding path program 1 times [2024-12-02 08:28:04,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:28:04,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19719255] [2024-12-02 08:28:04,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:28:04,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:28:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:28:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:28:07,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:28:07,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19719255] [2024-12-02 08:28:07,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19719255] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:28:07,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:28:07,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-12-02 08:28:07,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532675655] [2024-12-02 08:28:07,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:28:07,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 08:28:07,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:28:07,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 08:28:07,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-12-02 08:28:07,355 INFO L87 Difference]: Start difference. First operand 1355 states and 1702 transitions. Second operand has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 12 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-12-02 08:28:19,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:28:19,298 INFO L93 Difference]: Finished difference Result 1354 states and 1700 transitions. [2024-12-02 08:28:19,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 08:28:19,299 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 12 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-12-02 08:28:19,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:28:19,300 INFO L225 Difference]: With dead ends: 1354 [2024-12-02 08:28:19,300 INFO L226 Difference]: Without dead ends: 1354 [2024-12-02 08:28:19,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-12-02 08:28:19,301 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 1454 mSDsluCounter, 2611 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 3109 SdHoareTripleChecker+Invalid, 2484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2024-12-02 08:28:19,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 3109 Invalid, 2484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 11.2s Time] [2024-12-02 08:28:19,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2024-12-02 08:28:19,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1354. [2024-12-02 08:28:19,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1123 states have (on average 1.5048975957257347) internal successors, (1690), 1346 states have internal predecessors, (1690), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:28:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1700 transitions. [2024-12-02 08:28:19,310 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1700 transitions. Word has length 113 [2024-12-02 08:28:19,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:28:19,311 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1700 transitions. [2024-12-02 08:28:19,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 12 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-12-02 08:28:19,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1700 transitions. [2024-12-02 08:28:19,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-02 08:28:19,311 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:28:19,312 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, 1, 1] [2024-12-02 08:28:19,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-12-02 08:28:19,312 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:28:19,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:28:19,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2039410445, now seen corresponding path program 1 times [2024-12-02 08:28:19,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:28:19,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628603422] [2024-12-02 08:28:19,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:28:19,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:28:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:28:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:28:19,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:28:19,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628603422] [2024-12-02 08:28:19,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628603422] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:28:19,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:28:19,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 08:28:19,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437244121] [2024-12-02 08:28:19,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:28:19,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 08:28:19,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:28:19,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 08:28:19,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 08:28:19,498 INFO L87 Difference]: Start difference. First operand 1354 states and 1700 transitions. Second operand has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 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-12-02 08:28:22,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:28:22,913 INFO L93 Difference]: Finished difference Result 1353 states and 1698 transitions. [2024-12-02 08:28:22,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 08:28:22,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 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 116 [2024-12-02 08:28:22,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:28:22,914 INFO L225 Difference]: With dead ends: 1353 [2024-12-02 08:28:22,914 INFO L226 Difference]: Without dead ends: 1353 [2024-12-02 08:28:22,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 08:28:22,915 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 5 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-12-02 08:28:22,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2417 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-12-02 08:28:22,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-12-02 08:28:22,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1353. [2024-12-02 08:28:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1123 states have (on average 1.5031166518254675) internal successors, (1688), 1345 states have internal predecessors, (1688), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:28:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1698 transitions. [2024-12-02 08:28:22,924 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1698 transitions. Word has length 116 [2024-12-02 08:28:22,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:28:22,924 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 1698 transitions. [2024-12-02 08:28:22,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 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-12-02 08:28:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1698 transitions. [2024-12-02 08:28:22,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-02 08:28:22,925 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:28:22,925 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, 1, 1] [2024-12-02 08:28:22,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-12-02 08:28:22,925 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:28:22,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:28:22,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2039410446, now seen corresponding path program 1 times [2024-12-02 08:28:22,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:28:22,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018957581] [2024-12-02 08:28:22,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:28:22,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:28:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:28:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:28:23,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:28:23,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018957581] [2024-12-02 08:28:23,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018957581] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:28:23,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:28:23,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 08:28:23,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500459194] [2024-12-02 08:28:23,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:28:23,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 08:28:23,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:28:23,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 08:28:23,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 08:28:23,231 INFO L87 Difference]: Start difference. First operand 1353 states and 1698 transitions. Second operand has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 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-12-02 08:28:26,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:28:26,921 INFO L93 Difference]: Finished difference Result 1352 states and 1696 transitions. [2024-12-02 08:28:26,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 08:28:26,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 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 116 [2024-12-02 08:28:26,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:28:26,923 INFO L225 Difference]: With dead ends: 1352 [2024-12-02 08:28:26,923 INFO L226 Difference]: Without dead ends: 1352 [2024-12-02 08:28:26,923 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-12-02 08:28:26,923 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 4 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:28:26,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2375 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-12-02 08:28:26,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2024-12-02 08:28:26,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1352. [2024-12-02 08:28:26,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1123 states have (on average 1.5013357079252003) internal successors, (1686), 1344 states have internal predecessors, (1686), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:28:26,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1696 transitions. [2024-12-02 08:28:26,933 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1696 transitions. Word has length 116 [2024-12-02 08:28:26,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:28:26,934 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 1696 transitions. [2024-12-02 08:28:26,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 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-12-02 08:28:26,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1696 transitions. [2024-12-02 08:28:26,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-02 08:28:26,934 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:28:26,934 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, 1, 1, 1] [2024-12-02 08:28:26,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-12-02 08:28:26,934 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:28:26,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:28:26,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1202784935, now seen corresponding path program 1 times [2024-12-02 08:28:26,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:28:26,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169271387] [2024-12-02 08:28:26,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:28:26,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:28:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:28:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:28:30,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:28:30,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169271387] [2024-12-02 08:28:30,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169271387] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:28:30,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:28:30,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-12-02 08:28:30,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182920256] [2024-12-02 08:28:30,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:28:30,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 08:28:30,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:28:30,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 08:28:30,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-12-02 08:28:30,051 INFO L87 Difference]: Start difference. First operand 1352 states and 1696 transitions. Second operand has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 states have internal predecessors, (115), 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-12-02 08:28:45,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:28:45,524 INFO L93 Difference]: Finished difference Result 1435 states and 1795 transitions. [2024-12-02 08:28:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-12-02 08:28:45,525 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 states have internal predecessors, (115), 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 117 [2024-12-02 08:28:45,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:28:45,526 INFO L225 Difference]: With dead ends: 1435 [2024-12-02 08:28:45,526 INFO L226 Difference]: Without dead ends: 1435 [2024-12-02 08:28:45,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2024-12-02 08:28:45,527 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 772 mSDsluCounter, 4430 mSDsCounter, 0 mSdLazyCounter, 3197 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 4927 SdHoareTripleChecker+Invalid, 3217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:28:45,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 4927 Invalid, 3217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3197 Invalid, 0 Unknown, 0 Unchecked, 14.0s Time] [2024-12-02 08:28:45,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2024-12-02 08:28:45,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1407. [2024-12-02 08:28:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1177 states have (on average 1.4791843670348344) internal successors, (1741), 1397 states have internal predecessors, (1741), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-12-02 08:28:45,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1757 transitions. [2024-12-02 08:28:45,537 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1757 transitions. Word has length 117 [2024-12-02 08:28:45,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:28:45,538 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 1757 transitions. [2024-12-02 08:28:45,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 states have internal predecessors, (115), 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-12-02 08:28:45,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1757 transitions. [2024-12-02 08:28:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-02 08:28:45,538 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:28:45,538 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, 1, 1, 1] [2024-12-02 08:28:45,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-12-02 08:28:45,539 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:28:45,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:28:45,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1202784934, now seen corresponding path program 1 times [2024-12-02 08:28:45,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:28:45,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172744480] [2024-12-02 08:28:45,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:28:45,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:28:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:28:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:28:48,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:28:48,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172744480] [2024-12-02 08:28:48,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172744480] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:28:48,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:28:48,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-12-02 08:28:48,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736905045] [2024-12-02 08:28:48,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:28:48,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 08:28:48,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:28:48,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 08:28:48,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-12-02 08:28:48,767 INFO L87 Difference]: Start difference. First operand 1407 states and 1757 transitions. Second operand has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 states have internal predecessors, (115), 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-12-02 08:29:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:29:07,428 INFO L93 Difference]: Finished difference Result 1434 states and 1793 transitions. [2024-12-02 08:29:07,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-12-02 08:29:07,428 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 states have internal predecessors, (115), 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 117 [2024-12-02 08:29:07,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:29:07,430 INFO L225 Difference]: With dead ends: 1434 [2024-12-02 08:29:07,430 INFO L226 Difference]: Without dead ends: 1434 [2024-12-02 08:29:07,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2024-12-02 08:29:07,430 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 802 mSDsluCounter, 4462 mSDsCounter, 0 mSdLazyCounter, 3826 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 4957 SdHoareTripleChecker+Invalid, 3847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2024-12-02 08:29:07,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 4957 Invalid, 3847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3826 Invalid, 0 Unknown, 0 Unchecked, 17.1s Time] [2024-12-02 08:29:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2024-12-02 08:29:07,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1407. [2024-12-02 08:29:07,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1175 states have (on average 1.48) internal successors, (1739), 1397 states have internal predecessors, (1739), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-12-02 08:29:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1755 transitions. [2024-12-02 08:29:07,441 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1755 transitions. Word has length 117 [2024-12-02 08:29:07,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:29:07,441 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 1755 transitions. [2024-12-02 08:29:07,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 states have internal predecessors, (115), 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-12-02 08:29:07,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1755 transitions. [2024-12-02 08:29:07,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-02 08:29:07,442 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:29:07,442 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, 1, 1, 1, 1] [2024-12-02 08:29:07,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-12-02 08:29:07,442 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:29:07,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:29:07,442 INFO L85 PathProgramCache]: Analyzing trace with hash -2087134074, now seen corresponding path program 1 times [2024-12-02 08:29:07,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:29:07,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874451466] [2024-12-02 08:29:07,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:29:07,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:29:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:29:10,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:29:10,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:29:10,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874451466] [2024-12-02 08:29:10,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874451466] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:29:10,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640100363] [2024-12-02 08:29:10,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:29:10,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:29:10,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:29:10,501 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:29:10,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 08:29:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:29:10,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-12-02 08:29:10,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:29:10,824 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-12-02 08:29:11,529 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 08:29:11,529 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-12-02 08:29:11,690 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-12-02 08:29:11,701 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-12-02 08:29:12,175 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:29:12,175 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:29:12,186 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-12-02 08:29:12,437 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:29:12,437 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:29:12,448 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-12-02 08:29:12,700 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:29:12,700 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:29:12,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-12-02 08:29:12,977 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:29:12,977 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:29:12,997 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-12-02 08:29:13,255 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:29:13,255 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:29:13,265 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-12-02 08:29:13,514 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-12-02 08:29:13,818 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-12-02 08:29:13,818 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:29:13,838 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-12-02 08:29:14,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 08:29:14,398 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-12-02 08:29:14,399 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-12-02 08:29:14,420 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-12-02 08:29:14,523 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-12-02 08:29:14,772 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-12-02 08:29:14,772 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-12-02 08:29:14,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:29:14,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:29:14,882 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (or (= 1 (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4017))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (not (= v_ArrVal_4017 (let ((.cse2 (+ 40 |c_ULTIMATE.start_main_#t~mem62#1.offset|))) (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base|) .cse2 (select v_ArrVal_4017 .cse2))))))) is different from false [2024-12-02 08:29:14,928 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (not (= (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select |c_#memory_$Pointer$#2.base| .cse1) .cse2 (select v_ArrVal_4017 .cse2))) v_ArrVal_4017)) (= (select |c_#valid| (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_4017))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1))))) is different from false [2024-12-02 08:29:15,047 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4015 (Array Int Int)) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#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$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4015))) (or (= (select |c_#valid| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4017 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-12-02 08:29:15,072 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-12-02 08:29:15,152 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_12|))) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4015)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_4017 (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4017 .cse2))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4017))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))) is different from false [2024-12-02 08:29:15,245 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse6 (store (select |c_#memory_$Pointer$#2.base| .cse6) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_12|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store |c_#memory_$Pointer$#2.offset| .cse6 v_ArrVal_4015))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4017 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-12-02 08:29:15,465 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4012 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4013)) (.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$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4012))) (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~malloc61#1.base_12|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_4015)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4017 .cse5))))))))))) is different from false [2024-12-02 08:29:15,604 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4012 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4012))) (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~malloc61#1.base_12|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse6 .cse7 v_ArrVal_4015))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4017 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) is different from false [2024-12-02 08:29:15,932 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4010)) (.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_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4011) .cse9 v_ArrVal_4012))) (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~malloc61#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4015)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4017))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4017 .cse5))) v_ArrVal_4017)))))))))) is different from false [2024-12-02 08:29:16,034 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4010))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4011) .cse10 v_ArrVal_4012))) (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~malloc61#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4015)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4017))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4017 .cse5))))))))))))))) is different from false [2024-12-02 08:29:16,240 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int)) (v_ArrVal_4008 (Array Int Int)) (v_ArrVal_4009 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4009)) (.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_4010))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4008) .cse9 v_ArrVal_4011) .cse10 v_ArrVal_4012))) (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~malloc61#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4015)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse4 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4017 .cse4))) v_ArrVal_4017)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2024-12-02 08:29:16,355 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int)) (v_ArrVal_4008 (Array Int Int)) (v_ArrVal_4009 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4009))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4010))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4008) .cse10 v_ArrVal_4011) .cse11 v_ArrVal_4012))) (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~malloc61#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4015)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4017))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc61#1.base_12|) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4017 .cse5))))))))))))))))) is different from false [2024-12-02 08:29:16,580 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (v_ArrVal_4006 (Array Int Int)) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4007 (Array Int Int)) (v_ArrVal_4018 (Array Int Int)) (v_ArrVal_4008 (Array Int Int)) (v_ArrVal_4009 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4006)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4009))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4010))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4007) .cse9 v_ArrVal_4008) .cse10 v_ArrVal_4011) .cse11 v_ArrVal_4012))) (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~malloc61#1.base_12|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse6 .cse7 v_ArrVal_4015))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4017 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) is different from false [2024-12-02 08:29:16,697 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (v_ArrVal_4006 (Array Int Int)) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4007 (Array Int Int)) (v_ArrVal_4018 (Array Int Int)) (v_ArrVal_4008 (Array Int Int)) (v_ArrVal_4009 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4006))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4009))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4010))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4007) .cse10 v_ArrVal_4008) .cse11 v_ArrVal_4011) .cse12 v_ArrVal_4012))) (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~malloc61#1.base_12|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_4015)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_4017 (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4017 .cse2))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4017))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))))) is different from false [2024-12-02 08:29:17,077 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4023 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (v_ArrVal_4024 (Array Int Int)) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (v_ArrVal_4006 (Array Int Int)) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4007 (Array Int Int)) (v_ArrVal_4018 (Array Int Int)) (v_ArrVal_4008 (Array Int Int)) (v_ArrVal_4009 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4023)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_4006))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4009))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4010))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4024) .cse9 v_ArrVal_4007) .cse10 v_ArrVal_4008) .cse11 v_ArrVal_4011) .cse12 v_ArrVal_4012))) (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~malloc61#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4015)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4017 (let ((.cse4 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4017 .cse4))))) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))))) is different from false [2024-12-02 08:29:17,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640100363] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:29:17,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:29:17,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 32 [2024-12-02 08:29:17,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564904431] [2024-12-02 08:29:17,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 08:29:17,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-12-02 08:29:17,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:29:17,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-12-02 08:29:17,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=960, Unknown=14, NotChecked=1050, Total=2162 [2024-12-02 08:29:17,086 INFO L87 Difference]: Start difference. First operand 1407 states and 1755 transitions. Second operand has 33 states, 30 states have (on average 6.3) internal successors, (189), 33 states have internal predecessors, (189), 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-12-02 08:29:43,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:29:43,160 INFO L93 Difference]: Finished difference Result 1431 states and 1789 transitions. [2024-12-02 08:29:43,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-12-02 08:29:43,161 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 6.3) internal successors, (189), 33 states have internal predecessors, (189), 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 118 [2024-12-02 08:29:43,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:29:43,162 INFO L225 Difference]: With dead ends: 1431 [2024-12-02 08:29:43,162 INFO L226 Difference]: Without dead ends: 1431 [2024-12-02 08:29:43,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=256, Invalid=1948, Unknown=14, NotChecked=1442, Total=3660 [2024-12-02 08:29:43,163 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 717 mSDsluCounter, 8296 mSDsCounter, 0 mSdLazyCounter, 5459 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 8793 SdHoareTripleChecker+Invalid, 5481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:29:43,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 8793 Invalid, 5481 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 5459 Invalid, 0 Unknown, 0 Unchecked, 24.0s Time] [2024-12-02 08:29:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2024-12-02 08:29:43,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1406. [2024-12-02 08:29:43,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1175 states have (on average 1.4782978723404254) internal successors, (1737), 1396 states have internal predecessors, (1737), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-12-02 08:29:43,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 1753 transitions. [2024-12-02 08:29:43,174 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 1753 transitions. Word has length 118 [2024-12-02 08:29:43,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:29:43,174 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 1753 transitions. [2024-12-02 08:29:43,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 6.3) internal successors, (189), 33 states have internal predecessors, (189), 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-12-02 08:29:43,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1753 transitions. [2024-12-02 08:29:43,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-02 08:29:43,175 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:29:43,175 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, 1, 1, 1, 1] [2024-12-02 08:29:43,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-12-02 08:29:43,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-12-02 08:29:43,376 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:29:43,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:29:43,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2087134073, now seen corresponding path program 1 times [2024-12-02 08:29:43,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:29:43,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068185409] [2024-12-02 08:29:43,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:29:43,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:29:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:29:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:29:46,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:29:46,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068185409] [2024-12-02 08:29:46,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068185409] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:29:46,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963298578] [2024-12-02 08:29:46,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:29:46,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:29:46,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:29:46,681 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:29:46,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 08:29:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:29:46,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-12-02 08:29:46,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:29:47,000 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-12-02 08:29:47,669 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 08:29:47,669 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-12-02 08:29:47,829 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-12-02 08:29:47,839 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-12-02 08:29:48,281 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:29:48,282 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:29:48,302 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-12-02 08:29:48,547 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:29:48,547 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:29:48,567 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-12-02 08:29:48,821 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:29:48,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-12-02 08:29:48,841 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-12-02 08:29:49,105 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:29:49,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 51 treesize of output 48 [2024-12-02 08:29:49,125 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-12-02 08:29:49,398 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:29:49,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 51 treesize of output 48 [2024-12-02 08:29:49,417 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-12-02 08:29:49,673 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-12-02 08:29:49,992 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-12-02 08:29:49,993 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:29:50,014 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-12-02 08:29:50,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 08:29:50,691 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-12-02 08:29:50,691 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-12-02 08:29:50,781 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-12-02 08:29:50,782 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-12-02 08:29:51,255 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-12-02 08:29:51,255 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-12-02 08:29:51,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:29:51,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:29:52,142 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base|)) (.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base|)) (.cse3 (+ 40 |c_ULTIMATE.start_main_#t~mem62#1.offset|))) (and (forall ((v_ArrVal_4250 (Array Int Int))) (or (forall ((v_ArrVal_4249 (Array Int Int))) (or (< 0 (+ (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4249))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (not (= (store .cse2 .cse3 (select v_ArrVal_4249 .cse3)) v_ArrVal_4249)))) (not (= (store .cse4 .cse3 (select v_ArrVal_4250 .cse3)) v_ArrVal_4250)))) (forall ((v_ArrVal_4250 (Array Int Int))) (or (forall ((v_ArrVal_4249 (Array Int Int))) (or (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4249)) (.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4250))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< (+ 383 (select (select .cse5 .cse6) .cse7)) (select |c_#length| (select (select .cse8 .cse6) .cse7))))) (not (= (store .cse2 .cse3 (select v_ArrVal_4249 .cse3)) v_ArrVal_4249)))) (not (= (store .cse4 .cse3 (select v_ArrVal_4250 .cse3)) v_ArrVal_4250)))))) is different from false [2024-12-02 08:29:52,268 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse7)) (.cse0 (select |c_#memory_$Pointer$#2.offset| .cse7)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int)) (or (forall ((v_ArrVal_4250 (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (forall ((v_ArrVal_4249 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_4249 .cse1)) v_ArrVal_4249)) (let ((.cse2 (store |c_#memory_$Pointer$#2.offset| .cse7 v_ArrVal_4249)) (.cse5 (store |c_#memory_$Pointer$#2.base| .cse7 v_ArrVal_4250))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (< (+ 383 (select (select .cse2 .cse3) .cse4)) (select |c_#length| (select (select .cse5 .cse3) .cse4))))))) (not (= v_ArrVal_4250 (store .cse8 .cse1 (select v_ArrVal_4250 .cse1))))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| .cse9))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int)) (or (forall ((v_ArrVal_4250 (Array Int Int))) (let ((.cse10 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (not (= v_ArrVal_4250 (store .cse8 .cse10 (select v_ArrVal_4250 .cse10)))) (forall ((v_ArrVal_4249 (Array Int Int))) (or (not (= (store .cse0 .cse10 (select v_ArrVal_4249 .cse10)) v_ArrVal_4249)) (< 0 (+ (let ((.cse11 (store |c_#memory_$Pointer$#2.offset| .cse7 v_ArrVal_4249))) (select (select .cse11 (select (select (store |c_#memory_$Pointer$#2.base| .cse7 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1))))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| .cse9))))))) is different from false [2024-12-02 08:29:57,239 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#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$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#1.offset|)))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse9 (select .cse8 .cse7)) (.cse11 (select .cse6 .cse7))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int)) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| .cse0) (forall ((v_ArrVal_4250 (Array Int Int))) (let ((.cse10 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (forall ((v_ArrVal_4249 (Array Int Int))) (or (let ((.cse1 (store .cse8 .cse7 v_ArrVal_4249)) (.cse4 (store .cse6 .cse7 v_ArrVal_4250))) (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) 383) (select |c_#length| (select (select .cse4 .cse2) .cse3))))) (not (= v_ArrVal_4249 (store .cse9 .cse10 (select v_ArrVal_4249 .cse10)))))) (not (= v_ArrVal_4250 (store .cse11 .cse10 (select v_ArrVal_4250 .cse10))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int)) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| .cse0) (forall ((v_ArrVal_4250 (Array Int Int))) (let ((.cse12 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (forall ((v_ArrVal_4249 (Array Int Int))) (or (not (= v_ArrVal_4249 (store .cse9 .cse12 (select v_ArrVal_4249 .cse12)))) (< 0 (+ (let ((.cse13 (store .cse8 .cse7 v_ArrVal_4249))) (select (select .cse13 (select (select (store .cse6 .cse7 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1)))) (not (= v_ArrVal_4250 (store .cse11 .cse12 (select v_ArrVal_4250 .cse12))))))))))))) is different from false [2024-12-02 08:29:57,326 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 757 treesize of output 664 [2024-12-02 08:29:58,730 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| 0))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base|))) (and (forall ((v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 v_prenex_40))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse0 (store .cse2 .cse3 v_prenex_42))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_prenex_42 (store (select .cse2 .cse3) .cse5 (select v_prenex_42 .cse5)))) (not (= v_prenex_41 (store (select .cse4 .cse3) .cse5 (select v_prenex_41 .cse5)))) (< v_prenex_40 .cse6))))) (forall ((v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse10 (+ 40 v_prenex_40)) (.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= v_prenex_42 (store (select .cse8 .cse9) .cse10 (select v_prenex_42 .cse10)))) (not (= v_prenex_41 (store (select .cse4 .cse9) .cse10 (select v_prenex_41 .cse10)))) (< (let ((.cse11 (store .cse4 .cse9 v_prenex_41))) (select (select .cse11 (select (select (store .cse8 .cse9 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (< v_prenex_40 .cse6))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse15 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (< 0 (+ (let ((.cse12 (store .cse4 .cse14 v_ArrVal_4249))) (select (select .cse12 (select (select (store .cse13 .cse14 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| .cse6) (not (= (store (select .cse4 .cse14) .cse15 (select v_ArrVal_4249 .cse15)) v_ArrVal_4249)) (not (= (store (select .cse13 .cse14) .cse15 (select v_ArrVal_4250 .cse15)) v_ArrVal_4250))))))))) is different from false [2024-12-02 08:30:01,331 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4244)) (.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4245))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse4 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse5 (+ 40 v_prenex_40))) (or (< (let ((.cse0 (store .cse4 .cse2 v_prenex_41))) (select (select .cse0 (select (select (store .cse1 .cse2 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) (< v_prenex_40 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= (store (select .cse1 .cse2) .cse5 (select v_prenex_42 .cse5)) v_prenex_42)) (not (= v_prenex_41 (store (select .cse4 .cse2) .cse5 (select v_prenex_41 .cse5)))))))))) (forall ((v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4244)) (.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4245))) (let ((.cse16 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse17 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse11 (store .cse18 .cse16 (store (select .cse18 .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse13 (+ 40 v_prenex_40)) (.cse10 (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 0))) (.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (< v_prenex_40 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= (store (select .cse11 .cse12) .cse13 (select v_prenex_42 .cse13)) v_prenex_42)) (not (= v_prenex_41 (store (select .cse10 .cse12) .cse13 (select v_prenex_41 .cse13)))) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse14 (store .cse11 .cse12 v_prenex_42))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse10 .cse12 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4244)) (.cse27 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4245))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse20 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse22 (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0))) (.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse23 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (< 0 (+ 1 (let ((.cse19 (store .cse22 .cse21 v_ArrVal_4249))) (select (select .cse19 (select (select (store .cse20 .cse21 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= (store (select .cse20 .cse21) .cse23 (select v_ArrVal_4250 .cse23)) v_ArrVal_4250)) (not (= v_ArrVal_4249 (store (select .cse22 .cse21) .cse23 (select v_ArrVal_4249 .cse23)))))))))))) is different from false [2024-12-02 08:30:02,129 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.offset| .cse11 v_ArrVal_4244)) (.cse2 (store |c_#memory_$Pointer$#2.base| .cse11 v_ArrVal_4245))) (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 ((.cse9 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40)) (.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0)))) (or (not (= (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4245 .cse4 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_ArrVal_4250 .cse5)) v_ArrVal_4250)) (not (= v_ArrVal_4249 (store (select .cse6 .cse7) .cse5 (select v_ArrVal_4249 .cse5)))) (< 0 (+ (let ((.cse8 (store .cse6 .cse7 v_ArrVal_4249))) (select (select .cse8 (select (select (store .cse9 .cse7 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (forall ((v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#2.offset| .cse11 v_ArrVal_4244)) (.cse20 (store |c_#memory_$Pointer$#2.base| .cse11 v_ArrVal_4245))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse18 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse20 .cse17 (store (select .cse20 .cse17) .cse18 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse19 (+ 40 v_prenex_40)) (.cse15 (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 0)))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse12 (store .cse13 .cse14 v_prenex_42))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse15 .cse14 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (store (select (store .cse16 .cse17 (store v_ArrVal_4244 .cse18 0)) .cse14) .cse19 (select v_prenex_41 .cse19)) v_prenex_41)) (not (= (store (select .cse13 .cse14) .cse19 (select v_prenex_42 .cse19)) v_prenex_42)) (< v_prenex_40 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (forall ((v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse30 (store |c_#memory_$Pointer$#2.offset| .cse11 v_ArrVal_4244)) (.cse27 (store |c_#memory_$Pointer$#2.base| .cse11 v_ArrVal_4245))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse29 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse22 (store .cse27 .cse28 (store (select .cse27 .cse28) .cse29 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse25 (+ 40 v_prenex_40)) (.cse24 (store .cse30 .cse28 (store (select .cse30 .cse28) .cse29 0)))) (or (< (let ((.cse21 (store .cse24 .cse23 v_prenex_41))) (select (select .cse21 (select (select (store .cse22 .cse23 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_prenex_41 (store (select .cse24 .cse23) .cse25 (select v_prenex_41 .cse25)))) (not (= (store (let ((.cse26 (store .cse27 .cse28 (store v_ArrVal_4245 .cse29 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse25 (select v_prenex_42 .cse25)) v_prenex_42)) (< v_prenex_40 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2024-12-02 08:30:03,399 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4243))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4242) .cse12 v_ArrVal_4244)) (.cse7 (store .cse11 .cse12 v_ArrVal_4245))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse0 (store .cse10 .cse8 (store (select .cse10 .cse8) .cse9 0))) (.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse3 (+ 40 v_prenex_40))) (or (< v_prenex_40 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_prenex_41 (store (select .cse0 .cse2) .cse3 (select v_prenex_41 .cse3)))) (< (let ((.cse4 (store .cse0 .cse2 v_prenex_41))) (select (select .cse4 (select (select (store .cse5 .cse2 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_prenex_42 (store (let ((.cse6 (store .cse7 .cse8 (store v_ArrVal_4245 .cse9 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse3 (select v_prenex_42 .cse3)))))))))))) (forall ((v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse22 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4243))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4242) .cse23 v_ArrVal_4244)) (.cse21 (store .cse22 .cse23 v_ArrVal_4245))) (let ((.cse14 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse15 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse19 (store .cse21 .cse14 (store (select .cse21 .cse14) .cse15 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse17 (+ 40 v_prenex_40)) (.cse18 (store .cse13 .cse14 (store (select .cse13 .cse14) .cse15 0))) (.cse16 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= (store (select (store .cse13 .cse14 (store v_ArrVal_4244 .cse15 0)) .cse16) .cse17 (select v_prenex_41 .cse17)) v_prenex_41)) (< v_prenex_40 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse19 .cse16) .cse17 (select v_prenex_42 .cse17)) v_prenex_42)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse20 (store .cse19 .cse16 v_prenex_42))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse18 .cse16 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4243))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4242) .cse35 v_ArrVal_4244)) (.cse28 (store .cse34 .cse35 v_ArrVal_4245))) (let ((.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse30 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse32 (store .cse28 .cse29 (store (select .cse28 .cse29) .cse30 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse26 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40)) (.cse25 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse24 (store .cse33 .cse29 (store (select .cse33 .cse29) .cse30 0)))) (or (not (= (store (select .cse24 .cse25) .cse26 (select v_ArrVal_4249 .cse26)) v_ArrVal_4249)) (not (= (store (let ((.cse27 (store .cse28 .cse29 (store v_ArrVal_4245 .cse30 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse26 (select v_ArrVal_4250 .cse26)) v_ArrVal_4250)) (< 0 (+ (let ((.cse31 (store .cse24 .cse25 v_ArrVal_4249))) (select (select .cse31 (select (select (store .cse32 .cse25 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-12-02 08:30:04,018 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (and (forall ((v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| .cse12 v_ArrVal_4243))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| .cse12 v_ArrVal_4242) .cse11 v_ArrVal_4244)) (.cse9 (store .cse10 .cse11 v_ArrVal_4245))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse4 (+ 40 v_prenex_40)) (.cse5 (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0))) (.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (or (not (= (store (select (store .cse0 .cse1 (store v_ArrVal_4244 .cse2 0)) .cse3) .cse4 (select v_prenex_41 .cse4)) v_prenex_41)) (< v_prenex_40 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (not (= v_prenex_42 (store (select .cse7 .cse3) .cse4 (select v_prenex_42 .cse4)))) (= (select (let ((.cse8 (store .cse7 .cse3 v_prenex_42))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (select (select (store .cse5 .cse3 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) |v_ULTIMATE.start_main_#t~malloc61#1.base_15|))))))))) (forall ((v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse23 (store |c_#memory_$Pointer$#2.base| .cse12 v_ArrVal_4243))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse22 (store (store |c_#memory_$Pointer$#2.offset| .cse12 v_ArrVal_4242) .cse24 v_ArrVal_4244)) (.cse15 (store .cse23 .cse24 v_ArrVal_4245))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse17 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse20 (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse13 (store .cse22 .cse16 (store (select .cse22 .cse16) .cse17 0))) (.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse18 (+ 40 v_prenex_40))) (or (< v_prenex_40 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (not (= v_prenex_42 (store (let ((.cse14 (store .cse15 .cse16 (store v_ArrVal_4245 .cse17 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) .cse18 (select v_prenex_42 .cse18)))) (< (let ((.cse19 (store .cse13 .cse21 v_prenex_41))) (select (select .cse19 (select (select (store .cse20 .cse21 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1) (not (= (store (select .cse13 .cse21) .cse18 (select v_prenex_41 .cse18)) v_prenex_41)))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$#2.base| .cse12 v_ArrVal_4243))) (let ((.cse36 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse34 (store (store |c_#memory_$Pointer$#2.offset| .cse12 v_ArrVal_4242) .cse36 v_ArrVal_4244)) (.cse29 (store .cse35 .cse36 v_ArrVal_4245))) (let ((.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse31 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse33 (store .cse29 .cse30 (store (select .cse29 .cse30) .cse31 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse27 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40)) (.cse25 (store .cse34 .cse30 (store (select .cse34 .cse30) .cse31 0))) (.cse26 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (or (not (= v_ArrVal_4249 (store (select .cse25 .cse26) .cse27 (select v_ArrVal_4249 .cse27)))) (not (= (store (let ((.cse28 (store .cse29 .cse30 (store v_ArrVal_4245 .cse31 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse28 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) .cse27 (select v_ArrVal_4250 .cse27)) v_ArrVal_4250)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (< 0 (+ (let ((.cse32 (store .cse25 .cse26 v_ArrVal_4249))) (select (select .cse32 (select (select (store .cse33 .cse26 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1))))))))))))) is different from false [2024-12-02 08:30:05,324 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4240 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4240))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_4243))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4241) .cse13 v_ArrVal_4242) .cse12 v_ArrVal_4244)) (.cse6 (store .cse11 .cse12 v_ArrVal_4245))) (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 ((.cse1 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse4 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0))) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse9 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (< 0 (+ (let ((.cse0 (store .cse4 .cse2 v_ArrVal_4249))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_4250) |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~mem62#1.offset_13| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= (store (let ((.cse5 (store .cse6 .cse7 (store v_ArrVal_4245 .cse8 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse9 (select v_ArrVal_4250 .cse9)) v_ArrVal_4250)) (not (= v_ArrVal_4249 (store (select .cse4 .cse2) .cse9 (select v_ArrVal_4249 .cse9)))))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse27 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4240))) (let ((.cse26 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse24 (store .cse27 .cse26 v_ArrVal_4243))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse19 (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4241) .cse26 v_ArrVal_4242) .cse25 v_ArrVal_4244)) (.cse23 (store .cse24 .cse25 v_ArrVal_4245))) (let ((.cse20 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse21 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse16 (store .cse23 .cse20 (store (select .cse23 .cse20) .cse21 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse18 (store .cse19 .cse20 (store (select .cse19 .cse20) .cse21 0))) (.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse22 (+ 40 v_prenex_40))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse15 (store .cse16 .cse17 v_prenex_42))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse18 .cse17 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (not (= (store (select (store .cse19 .cse20 (store v_ArrVal_4244 .cse21 0)) .cse17) .cse22 (select v_prenex_41 .cse22)) v_prenex_41)) (< v_prenex_40 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_prenex_42 (store (select .cse16 .cse17) .cse22 (select v_prenex_42 .cse22)))))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse41 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4240))) (let ((.cse40 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse38 (store .cse41 .cse40 v_ArrVal_4243))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse37 (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4241) .cse40 v_ArrVal_4242) .cse39 v_ArrVal_4244)) (.cse29 (store .cse38 .cse39 v_ArrVal_4245))) (let ((.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse31 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse36 (store .cse29 .cse30 (store (select .cse29 .cse30) .cse31 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse32 (+ 40 v_prenex_40)) (.cse34 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse33 (store .cse37 .cse30 (store (select .cse37 .cse30) .cse31 0)))) (or (not (= v_prenex_42 (store (let ((.cse28 (store .cse29 .cse30 (store v_ArrVal_4245 .cse31 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse28 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse32 (select v_prenex_42 .cse32)))) (not (= (store (select .cse33 .cse34) .cse32 (select v_prenex_41 .cse32)) v_prenex_41)) (< (let ((.cse35 (store .cse33 .cse34 v_prenex_41))) (select (select .cse35 (select (select (store .cse36 .cse34 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1) (< v_prenex_40 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-12-02 08:30:06,143 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse13 v_ArrVal_4240))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse15 .cse14 v_ArrVal_4243))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#2.offset| .cse13 v_ArrVal_4241) .cse14 v_ArrVal_4242) .cse12 v_ArrVal_4244)) (.cse7 (store .cse11 .cse12 v_ArrVal_4245))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse0 (store .cse10 .cse8 (store (select .cse10 .cse8) .cse9 0))) (.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse3 (+ 40 v_prenex_40))) (or (< v_prenex_40 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse0 .cse2) .cse3 (select v_prenex_41 .cse3)) v_prenex_41)) (< (let ((.cse4 (store .cse0 .cse2 v_prenex_41))) (select (select .cse4 (select (select (store .cse5 .cse2 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= (store (let ((.cse6 (store .cse7 .cse8 (store v_ArrVal_4245 .cse9 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse3 (select v_prenex_42 .cse3)) v_prenex_42)))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$#2.base| .cse13 v_ArrVal_4240))) (let ((.cse28 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store .cse29 .cse28 v_ArrVal_4243))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store (store (store |c_#memory_$Pointer$#2.offset| .cse13 v_ArrVal_4241) .cse28 v_ArrVal_4242) .cse27 v_ArrVal_4244)) (.cse20 (store .cse26 .cse27 v_ArrVal_4245))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse22 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse18 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40)) (.cse16 (store .cse25 .cse21 (store (select .cse25 .cse21) .cse22 0))) (.cse17 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= (store (select .cse16 .cse17) .cse18 (select v_ArrVal_4249 .cse18)) v_ArrVal_4249)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (let ((.cse19 (store .cse20 .cse21 (store v_ArrVal_4245 .cse22 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse18 (select v_ArrVal_4250 .cse18)) v_ArrVal_4250)) (< 0 (+ (let ((.cse23 (store .cse16 .cse17 v_ArrVal_4249))) (select (select .cse23 (select (select (store .cse24 .cse17 v_ArrVal_4250) |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_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse42 (store |c_#memory_$Pointer$#2.base| .cse13 v_ArrVal_4240))) (let ((.cse41 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse39 (store .cse42 .cse41 v_ArrVal_4243))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store (store (store |c_#memory_$Pointer$#2.offset| .cse13 v_ArrVal_4241) .cse41 v_ArrVal_4242) .cse40 v_ArrVal_4244)) (.cse38 (store .cse39 .cse40 v_ArrVal_4245))) (let ((.cse32 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse33 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse36 (store .cse38 .cse32 (store (select .cse38 .cse32) .cse33 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse35 (+ 40 v_prenex_40)) (.cse30 (store .cse31 .cse32 (store (select .cse31 .cse32) .cse33 0))) (.cse34 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< v_prenex_40 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select (store .cse31 .cse32 (store v_ArrVal_4244 .cse33 0)) .cse34) .cse35 (select v_prenex_41 .cse35)) v_prenex_41)) (not (= v_prenex_42 (store (select .cse36 .cse34) .cse35 (select v_prenex_42 .cse35)))) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse37 (store .cse36 .cse34 v_prenex_42))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse30 .cse34 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) is different from false [2024-12-02 08:30:08,712 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_prenex_40 Int) (v_ArrVal_4239 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4238))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_4240))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse14 .cse13 v_ArrVal_4243))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4239) .cse12 v_ArrVal_4241) .cse13 v_ArrVal_4242) .cse11 v_ArrVal_4244)) (.cse9 (store .cse10 .cse11 v_ArrVal_4245))) (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 ((.cse3 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse0 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 v_prenex_40))) (or (< v_prenex_40 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse2 (store .cse3 .cse4 v_prenex_42))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (store (select .cse3 .cse4) .cse5 (select v_prenex_42 .cse5)) v_prenex_42)) (not (= v_prenex_41 (store (select (store .cse6 .cse7 (store v_ArrVal_4244 .cse8 0)) .cse4) .cse5 (select v_prenex_41 .cse5)))))))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (v_ArrVal_4239 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse31 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4238))) (let ((.cse28 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse30 (store .cse31 .cse28 v_ArrVal_4240))) (let ((.cse29 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store .cse30 .cse29 v_ArrVal_4243))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4239) .cse28 v_ArrVal_4241) .cse29 v_ArrVal_4242) .cse27 v_ArrVal_4244)) (.cse20 (store .cse26 .cse27 v_ArrVal_4245))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse22 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse18 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40)) (.cse16 (store .cse25 .cse21 (store (select .cse25 .cse21) .cse22 0))) (.cse17 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= (store (select .cse16 .cse17) .cse18 (select v_ArrVal_4249 .cse18)) v_ArrVal_4249)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4250 (store (let ((.cse19 (store .cse20 .cse21 (store v_ArrVal_4245 .cse22 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse18 (select v_ArrVal_4250 .cse18)))) (< 0 (+ (let ((.cse23 (store .cse16 .cse17 v_ArrVal_4249))) (select (select .cse23 (select (select (store .cse24 .cse17 v_ArrVal_4250) |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_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_prenex_40 Int) (v_ArrVal_4239 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse47 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4238))) (let ((.cse44 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse46 (store .cse47 .cse44 v_ArrVal_4240))) (let ((.cse45 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse42 (store .cse46 .cse45 v_ArrVal_4243))) (let ((.cse43 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse41 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4239) .cse44 v_ArrVal_4241) .cse45 v_ArrVal_4242) .cse43 v_ArrVal_4244)) (.cse38 (store .cse42 .cse43 v_ArrVal_4245))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse40 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse35 (store .cse41 .cse39 (store (select .cse41 .cse39) .cse40 0))) (.cse34 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse36 (+ 40 v_prenex_40))) (or (< (let ((.cse32 (store .cse35 .cse34 v_prenex_41))) (select (select .cse32 (select (select (store .cse33 .cse34 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (< v_prenex_40 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse35 .cse34) .cse36 (select v_prenex_41 .cse36)) v_prenex_41)) (not (= (store (let ((.cse37 (store .cse38 .cse39 (store v_ArrVal_4245 .cse40 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse36 (select v_prenex_42 .cse36)) v_prenex_42)))))))))))))))) is different from false [2024-12-02 08:30:09,615 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (and (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_prenex_40 Int) (v_ArrVal_4239 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| .cse12 v_ArrVal_4238))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_4240))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse10 (store .cse15 .cse14 v_ArrVal_4243))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse0 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse12 v_ArrVal_4239) .cse13 v_ArrVal_4241) .cse14 v_ArrVal_4242) .cse11 v_ArrVal_4244)) (.cse9 (store .cse10 .cse11 v_ArrVal_4245))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse4 (+ 40 v_prenex_40)) (.cse8 (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0)))) (or (not (= (store (select (store .cse0 .cse1 (store v_ArrVal_4244 .cse2 0)) .cse3) .cse4 (select v_prenex_41 .cse4)) v_prenex_41)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse5 (store .cse7 .cse3 v_prenex_42))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (select (select (store .cse8 .cse3 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (not (= (store (select .cse7 .cse3) .cse4 (select v_prenex_42 .cse4)) v_prenex_42)) (< v_prenex_40 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_prenex_40 Int) (v_ArrVal_4239 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse32 (store |c_#memory_$Pointer$#2.base| .cse12 v_ArrVal_4238))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse31 (store .cse32 .cse29 v_ArrVal_4240))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse27 (store .cse31 .cse30 v_ArrVal_4243))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse26 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse12 v_ArrVal_4239) .cse29 v_ArrVal_4241) .cse30 v_ArrVal_4242) .cse28 v_ArrVal_4244)) (.cse22 (store .cse27 .cse28 v_ArrVal_4245))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse24 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse18 (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse25 (+ 40 v_prenex_40)) (.cse20 (store .cse26 .cse23 (store (select .cse26 .cse23) .cse24 0)))) (or (< (let ((.cse17 (store .cse20 .cse19 v_prenex_41))) (select (select .cse17 (select (select (store .cse18 .cse19 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1) (not (= (store (let ((.cse21 (store .cse22 .cse23 (store v_ArrVal_4245 .cse24 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) .cse25 (select v_prenex_42 .cse25)) v_prenex_42)) (not (= (store (select .cse20 .cse19) .cse25 (select v_prenex_41 .cse25)) v_prenex_41)) (< v_prenex_40 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (v_ArrVal_4239 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse48 (store |c_#memory_$Pointer$#2.base| .cse12 v_ArrVal_4238))) (let ((.cse45 (select (select .cse48 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse47 (store .cse48 .cse45 v_ArrVal_4240))) (let ((.cse46 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse43 (store .cse47 .cse46 v_ArrVal_4243))) (let ((.cse44 (select (select .cse43 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse42 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse12 v_ArrVal_4239) .cse45 v_ArrVal_4241) .cse46 v_ArrVal_4242) .cse44 v_ArrVal_4244)) (.cse38 (store .cse43 .cse44 v_ArrVal_4245))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse40 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse34 (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse41 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40)) (.cse36 (store .cse42 .cse39 (store (select .cse42 .cse39) .cse40 0)))) (or (< 0 (+ (let ((.cse33 (store .cse36 .cse35 v_ArrVal_4249))) (select (select .cse33 (select (select (store .cse34 .cse35 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1)) (not (= v_ArrVal_4250 (store (let ((.cse37 (store .cse38 .cse39 (store v_ArrVal_4245 .cse40 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) .cse41 (select v_ArrVal_4250 .cse41)))) (not (= v_ArrVal_4249 (store (select .cse36 .cse35) .cse41 (select v_ArrVal_4249 .cse41)))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))))))))))) is different from false [2024-12-02 08:30:11,482 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int)) (v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4255 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (v_ArrVal_4239 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4256))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_4238))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_4240))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse11 (store .cse16 .cse15 v_ArrVal_4243))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4255) .cse13 v_ArrVal_4239) .cse14 v_ArrVal_4241) .cse15 v_ArrVal_4242) .cse12 v_ArrVal_4244)) (.cse7 (store .cse11 .cse12 v_ArrVal_4245))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse4 (store .cse10 .cse8 (store (select .cse10 .cse8) .cse9 0))) (.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (< 0 (+ (let ((.cse0 (store .cse4 .cse2 v_ArrVal_4249))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1)) (not (= v_ArrVal_4249 (store (select .cse4 .cse2) .cse5 (select v_ArrVal_4249 .cse5)))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_ArrVal_4250 (store (let ((.cse6 (store .cse7 .cse8 (store v_ArrVal_4245 .cse9 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse5 (select v_ArrVal_4250 .cse5)))))))))))))))))) (forall ((v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4255 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4239 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4256))) (let ((.cse30 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse34 (store .cse35 .cse30 v_ArrVal_4238))) (let ((.cse31 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse33 (store .cse34 .cse31 v_ArrVal_4240))) (let ((.cse32 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse28 (store .cse33 .cse32 v_ArrVal_4243))) (let ((.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse24 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4255) .cse30 v_ArrVal_4239) .cse31 v_ArrVal_4241) .cse32 v_ArrVal_4242) .cse29 v_ArrVal_4244)) (.cse27 (store .cse28 .cse29 v_ArrVal_4245))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse20 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse22 (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0))) (.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse23 (+ 40 v_prenex_40))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse19 (store .cse20 .cse21 v_prenex_42))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse22 .cse21 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (< v_prenex_40 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_prenex_42 (store (select .cse20 .cse21) .cse23 (select v_prenex_42 .cse23)))) (not (= (store (select (store .cse24 .cse25 (store v_ArrVal_4244 .cse26 0)) .cse21) .cse23 (select v_prenex_41 .cse23)) v_prenex_41)))))))))))))))) (forall ((v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4255 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4239 (Array Int Int))) (let ((.cse53 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4256))) (let ((.cse48 (select (select .cse53 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse52 (store .cse53 .cse48 v_ArrVal_4238))) (let ((.cse49 (select (select .cse52 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse51 (store .cse52 .cse49 v_ArrVal_4240))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse46 (store .cse51 .cse50 v_ArrVal_4243))) (let ((.cse47 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse45 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4255) .cse48 v_ArrVal_4239) .cse49 v_ArrVal_4241) .cse50 v_ArrVal_4242) .cse47 v_ArrVal_4244)) (.cse42 (store .cse46 .cse47 v_ArrVal_4245))) (let ((.cse43 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse44 (select (select .cse45 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse38 (store .cse42 .cse43 (store (select .cse42 .cse43) .cse44 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse36 (store .cse45 .cse43 (store (select .cse45 .cse43) .cse44 0))) (.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse40 (+ 40 v_prenex_40))) (or (< v_prenex_40 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (< (let ((.cse37 (store .cse36 .cse39 v_prenex_41))) (select (select .cse37 (select (select (store .cse38 .cse39 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1) (not (= v_prenex_41 (store (select .cse36 .cse39) .cse40 (select v_prenex_41 .cse40)))) (not (= (store (let ((.cse41 (store .cse42 .cse43 (store v_ArrVal_4245 .cse44 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse41 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse40 (select v_prenex_42 .cse40)) v_prenex_42)))))))))))))))))) is different from false [2024-12-02 08:30:11,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963298578] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:30:11,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:30:11,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 32 [2024-12-02 08:30:11,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202209322] [2024-12-02 08:30:11,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 08:30:11,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-12-02 08:30:11,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:30:11,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-12-02 08:30:11,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1201, Unknown=13, NotChecked=1066, Total=2450 [2024-12-02 08:30:11,813 INFO L87 Difference]: Start difference. First operand 1406 states and 1753 transitions. Second operand has 33 states, 30 states have (on average 6.3) internal successors, (189), 33 states have internal predecessors, (189), 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-12-02 08:30:54,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:30:54,188 INFO L93 Difference]: Finished difference Result 1430 states and 1787 transitions. [2024-12-02 08:30:54,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-12-02 08:30:54,189 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 6.3) internal successors, (189), 33 states have internal predecessors, (189), 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 118 [2024-12-02 08:30:54,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:30:54,191 INFO L225 Difference]: With dead ends: 1430 [2024-12-02 08:30:54,191 INFO L226 Difference]: Without dead ends: 1430 [2024-12-02 08:30:54,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=307, Invalid=2282, Unknown=13, NotChecked=1430, Total=4032 [2024-12-02 08:30:54,192 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 745 mSDsluCounter, 7964 mSDsCounter, 0 mSdLazyCounter, 5875 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 8458 SdHoareTripleChecker+Invalid, 5897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.9s IncrementalHoareTripleChecker+Time [2024-12-02 08:30:54,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 8458 Invalid, 5897 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 5875 Invalid, 0 Unknown, 0 Unchecked, 38.9s Time] [2024-12-02 08:30:54,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2024-12-02 08:30:54,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1350. [2024-12-02 08:30:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1121 states have (on average 1.5004460303300624) internal successors, (1682), 1342 states have internal predecessors, (1682), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:30:54,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1692 transitions. [2024-12-02 08:30:54,203 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1692 transitions. Word has length 118 [2024-12-02 08:30:54,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:30:54,203 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 1692 transitions. [2024-12-02 08:30:54,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 6.3) internal successors, (189), 33 states have internal predecessors, (189), 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-12-02 08:30:54,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1692 transitions. [2024-12-02 08:30:54,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-12-02 08:30:54,204 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:30:54,204 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, 1, 1] [2024-12-02 08:30:54,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-12-02 08:30:54,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2024-12-02 08:30:54,405 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr143REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:30:54,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:30:54,405 INFO L85 PathProgramCache]: Analyzing trace with hash 686956707, now seen corresponding path program 1 times [2024-12-02 08:30:54,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:30:54,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960200288] [2024-12-02 08:30:54,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:30:54,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:30:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:30:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 08:30:54,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:30:54,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960200288] [2024-12-02 08:30:54,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960200288] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:30:54,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:30:54,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:30:54,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748785231] [2024-12-02 08:30:54,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:30:54,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:30:54,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:30:54,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:30:54,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:30:54,559 INFO L87 Difference]: Start difference. First operand 1350 states and 1692 transitions. Second operand has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 4 states have internal predecessors, (119), 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-12-02 08:30:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:30:57,784 INFO L93 Difference]: Finished difference Result 1650 states and 2071 transitions. [2024-12-02 08:30:57,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 08:30:57,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 4 states have internal predecessors, (119), 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 127 [2024-12-02 08:30:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:30:57,786 INFO L225 Difference]: With dead ends: 1650 [2024-12-02 08:30:57,786 INFO L226 Difference]: Without dead ends: 1650 [2024-12-02 08:30:57,786 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-12-02 08:30:57,786 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 1494 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-12-02 08:30:57,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 911 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-12-02 08:30:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2024-12-02 08:30:57,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1534. [2024-12-02 08:30:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 1316 states have (on average 1.4620060790273557) internal successors, (1924), 1526 states have internal predecessors, (1924), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:30:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 1934 transitions. [2024-12-02 08:30:57,802 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 1934 transitions. Word has length 127 [2024-12-02 08:30:57,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:30:57,802 INFO L471 AbstractCegarLoop]: Abstraction has 1534 states and 1934 transitions. [2024-12-02 08:30:57,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 4 states have internal predecessors, (119), 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-12-02 08:30:57,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 1934 transitions. [2024-12-02 08:30:57,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-12-02 08:30:57,803 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:30:57,803 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, 1, 1] [2024-12-02 08:30:57,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-12-02 08:30:57,803 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr144REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:30:57,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:30:57,804 INFO L85 PathProgramCache]: Analyzing trace with hash 686956708, now seen corresponding path program 1 times [2024-12-02 08:30:57,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:30:57,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568431532] [2024-12-02 08:30:57,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:30:57,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:30:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:30:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 08:30:58,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:30:58,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568431532] [2024-12-02 08:30:58,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568431532] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:30:58,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:30:58,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 08:30:58,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753266760] [2024-12-02 08:30:58,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:30:58,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 08:30:58,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:30:58,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 08:30:58,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 08:30:58,150 INFO L87 Difference]: Start difference. First operand 1534 states and 1934 transitions. Second operand has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 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-12-02 08:31:02,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:31:02,709 INFO L93 Difference]: Finished difference Result 2008 states and 2501 transitions. [2024-12-02 08:31:02,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 08:31:02,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 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 127 [2024-12-02 08:31:02,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:31:02,712 INFO L225 Difference]: With dead ends: 2008 [2024-12-02 08:31:02,712 INFO L226 Difference]: Without dead ends: 2008 [2024-12-02 08:31:02,712 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-12-02 08:31:02,712 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 2460 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2462 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-12-02 08:31:02,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2462 Valid, 1052 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-12-02 08:31:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2024-12-02 08:31:02,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1819. [2024-12-02 08:31:02,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1819 states, 1623 states have (on average 1.4460874922982132) internal successors, (2347), 1811 states have internal predecessors, (2347), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:31:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 2357 transitions. [2024-12-02 08:31:02,728 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 2357 transitions. Word has length 127 [2024-12-02 08:31:02,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:31:02,728 INFO L471 AbstractCegarLoop]: Abstraction has 1819 states and 2357 transitions. [2024-12-02 08:31:02,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 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-12-02 08:31:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 2357 transitions. [2024-12-02 08:31:02,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-12-02 08:31:02,729 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:31:02,729 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, 1, 1, 1] [2024-12-02 08:31:02,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-12-02 08:31:02,730 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:31:02,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:31:02,730 INFO L85 PathProgramCache]: Analyzing trace with hash -179177775, now seen corresponding path program 1 times [2024-12-02 08:31:02,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:31:02,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849847577] [2024-12-02 08:31:02,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:31:02,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:31:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:31:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 08:31:02,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:31:02,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849847577] [2024-12-02 08:31:02,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849847577] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:31:02,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408769518] [2024-12-02 08:31:02,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:31:02,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:31:02,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:31:02,986 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:31:02,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-02 08:31:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:31:03,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-12-02 08:31:03,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:31:03,342 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-12-02 08:31:04,401 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 08:31:04,401 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-12-02 08:31:04,491 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-12-02 08:31:05,041 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:31:05,041 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:31:05,310 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:31:05,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-12-02 08:31:05,588 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:31:05,588 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:31:05,871 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:31:05,871 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:31:06,207 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:31:06,207 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:31:06,760 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:31:06,761 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:31:06,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-12-02 08:31:07,810 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-12-02 08:31:07,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:31:07,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 08:31:07,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408769518] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:31:07,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 08:31:07,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [4] total 18 [2024-12-02 08:31:07,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734058074] [2024-12-02 08:31:07,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:31:07,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 08:31:07,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:31:07,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 08:31:07,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-12-02 08:31:07,985 INFO L87 Difference]: Start difference. First operand 1819 states and 2357 transitions. Second operand has 16 states, 15 states have (on average 8.266666666666667) internal successors, (124), 16 states have internal predecessors, (124), 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-12-02 08:31:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:31:27,268 INFO L93 Difference]: Finished difference Result 1894 states and 2441 transitions. [2024-12-02 08:31:27,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 08:31:27,269 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 8.266666666666667) internal successors, (124), 16 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 128 [2024-12-02 08:31:27,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:31:27,270 INFO L225 Difference]: With dead ends: 1894 [2024-12-02 08:31:27,271 INFO L226 Difference]: Without dead ends: 1894 [2024-12-02 08:31:27,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2024-12-02 08:31:27,272 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 707 mSDsluCounter, 4381 mSDsCounter, 0 mSdLazyCounter, 2747 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 4873 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:31:27,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 4873 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2747 Invalid, 0 Unknown, 0 Unchecked, 17.6s Time] [2024-12-02 08:31:27,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2024-12-02 08:31:27,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1888. [2024-12-02 08:31:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1689 states have (on average 1.4292480757844879) internal successors, (2414), 1876 states have internal predecessors, (2414), 7 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (14), 9 states have call predecessors, (14), 7 states have call successors, (14) [2024-12-02 08:31:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2435 transitions. [2024-12-02 08:31:27,286 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2435 transitions. Word has length 128 [2024-12-02 08:31:27,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:31:27,286 INFO L471 AbstractCegarLoop]: Abstraction has 1888 states and 2435 transitions. [2024-12-02 08:31:27,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 8.266666666666667) internal successors, (124), 16 states have internal predecessors, (124), 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-12-02 08:31:27,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2435 transitions. [2024-12-02 08:31:27,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-12-02 08:31:27,287 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:31:27,287 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, 1, 1, 1] [2024-12-02 08:31:27,295 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-12-02 08:31:27,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2024-12-02 08:31:27,488 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:31:27,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:31:27,488 INFO L85 PathProgramCache]: Analyzing trace with hash -179177774, now seen corresponding path program 1 times [2024-12-02 08:31:27,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:31:27,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729188299] [2024-12-02 08:31:27,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:31:27,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:31:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:31:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 08:31:27,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:31:27,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729188299] [2024-12-02 08:31:27,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729188299] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:31:27,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250330602] [2024-12-02 08:31:27,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:31:27,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:31:27,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:31:27,749 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:31:27,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-12-02 08:31:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:31:28,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-12-02 08:31:28,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:31:28,103 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-12-02 08:31:30,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-02 08:31:30,249 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-12-02 08:31:30,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-12-02 08:31:30,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-12-02 08:31:30,553 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-12-02 08:31:31,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-12-02 08:31:31,073 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-12-02 08:31:32,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 08:31:32,272 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 90 treesize of output 50 [2024-12-02 08:31:32,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 08:31:32,872 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:31:32,873 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:31:32,930 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-12-02 08:31:33,472 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:31:33,472 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:31:33,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 08:31:34,071 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:31:34,071 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:31:34,119 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-12-02 08:31:34,765 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-12-02 08:31:34,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-12-02 08:31:34,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-12-02 08:31:35,041 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:31:35,041 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:31:35,083 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-12-02 08:31:35,638 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:31:35,638 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:31:35,680 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-12-02 08:31:36,067 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-12-02 08:31:36,082 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-12-02 08:31:37,025 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-12-02 08:31:37,053 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-12-02 08:31:37,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:31:37,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:31:39,843 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4870) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4871) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12))) (forall ((v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4872 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4869))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 16 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4870) .cse1 v_ArrVal_4871) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_4872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-12-02 08:31:40,981 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4866 (Array Int Int)) (v_ArrVal_4867 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4866))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4867) .cse0 v_ArrVal_4870) (select (select (store .cse1 .cse0 v_ArrVal_4869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4871))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|) 0)))) (forall ((v_ArrVal_4866 (Array Int Int)) (v_ArrVal_4867 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|) 0)) (forall ((v_ArrVal_4868 Int) (v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4872 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4866))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_4869))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4867) .cse3 v_ArrVal_4870) .cse4 v_ArrVal_4871) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 16) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_17| v_ArrVal_4868) (select (select (store .cse5 .cse4 v_ArrVal_4872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))) is different from false [2024-12-02 08:32:32,750 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base|)) (.cse10 (+ |c_ULTIMATE.start_main_#t~mem56#1.offset| 16))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|) 0))) (forall ((v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4860 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4862 (Array Int Int)) (v_ArrVal_4863 (Array Int Int)) (v_ArrVal_4864 (Array Int Int)) (v_ArrVal_4865 (Array Int Int)) (v_ArrVal_4866 (Array Int Int)) (v_ArrVal_4861 Int) (v_ArrVal_4867 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (<= 0 (+ 12 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store .cse9 .cse10 v_ArrVal_4861)))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_4862))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_4864))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_4866))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4860) .cse0 v_ArrVal_4863) .cse1 v_ArrVal_4865) .cse2 v_ArrVal_4867) .cse3 v_ArrVal_4870) (select (select (store .cse4 .cse3 v_ArrVal_4869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_4871))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))) (forall ((v_ArrVal_4860 (Array Int Int)) (v_ArrVal_4862 (Array Int Int)) (v_ArrVal_4863 (Array Int Int)) (v_ArrVal_4864 (Array Int Int)) (v_ArrVal_4865 (Array Int Int)) (v_ArrVal_4866 (Array Int Int)) (v_ArrVal_4861 Int) (v_ArrVal_4867 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (or (forall ((v_ArrVal_4868 Int) (v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4872 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store .cse9 .cse10 v_ArrVal_4861)))) (let ((.cse11 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse19 (store .cse20 .cse11 v_ArrVal_4862))) (let ((.cse12 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse18 (store .cse19 .cse12 v_ArrVal_4864))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_4866))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_4869))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ 16 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4860) .cse11 v_ArrVal_4863) .cse12 v_ArrVal_4865) .cse13 v_ArrVal_4867) .cse14 v_ArrVal_4870) .cse15 v_ArrVal_4871) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_17| v_ArrVal_4868) (select (select (store .cse16 .cse15 v_ArrVal_4872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|) 0)))))) is different from false [2024-12-02 08:32:33,378 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse11 (select |c_#memory_$Pointer$#2.base| .cse1))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|) 0))) (forall ((|v_ULTIMATE.start_main_#t~mem56#1.offset_33| Int) (v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4860 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4862 (Array Int Int)) (v_ArrVal_4863 (Array Int Int)) (v_ArrVal_4864 (Array Int Int)) (v_ArrVal_4865 (Array Int Int)) (v_ArrVal_4866 (Array Int Int)) (v_ArrVal_4861 Int) (v_ArrVal_4867 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (or (< |v_ULTIMATE.start_main_#t~mem56#1.offset_33| .cse0) (< 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| .cse1 (store .cse11 (+ 16 |v_ULTIMATE.start_main_#t~mem56#1.offset_33|) v_ArrVal_4861)))) (let ((.cse2 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse9 (store .cse10 .cse2 v_ArrVal_4862))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_4864))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse6 (store .cse8 .cse4 v_ArrVal_4866))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_4860) .cse2 v_ArrVal_4863) .cse3 v_ArrVal_4865) .cse4 v_ArrVal_4867) .cse5 v_ArrVal_4870) (select (select (store .cse6 .cse5 v_ArrVal_4869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) v_ArrVal_4871))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) 13))))) (forall ((|v_ULTIMATE.start_main_#t~mem56#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem56#1.offset_33| .cse0) (forall ((v_ArrVal_4860 (Array Int Int)) (v_ArrVal_4862 (Array Int Int)) (v_ArrVal_4863 (Array Int Int)) (v_ArrVal_4864 (Array Int Int)) (v_ArrVal_4865 (Array Int Int)) (v_ArrVal_4866 (Array Int Int)) (v_ArrVal_4861 Int) (v_ArrVal_4867 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|) 0)) (forall ((v_ArrVal_4868 Int) (v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4872 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$#2.base| .cse1 (store .cse11 (+ 16 |v_ULTIMATE.start_main_#t~mem56#1.offset_33|) v_ArrVal_4861)))) (let ((.cse12 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse20 (store .cse21 .cse12 v_ArrVal_4862))) (let ((.cse13 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse19 (store .cse20 .cse13 v_ArrVal_4864))) (let ((.cse14 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse18 (store .cse19 .cse14 v_ArrVal_4866))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_4869))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (<= (+ 16 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_4860) .cse12 v_ArrVal_4863) .cse13 v_ArrVal_4865) .cse14 v_ArrVal_4867) .cse15 v_ArrVal_4870) .cse16 v_ArrVal_4871) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_17| v_ArrVal_4868) (select (select (store .cse17 .cse16 v_ArrVal_4872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)))))))))))))))))))))) is different from false [2024-12-02 08:32:34,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250330602] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:32:34,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:32:34,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 16] total 19 [2024-12-02 08:32:34,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296797797] [2024-12-02 08:32:34,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 08:32:34,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 08:32:34,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:32:34,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 08:32:34,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=804, Unknown=60, NotChecked=252, Total=1260 [2024-12-02 08:32:34,752 INFO L87 Difference]: Start difference. First operand 1888 states and 2435 transitions. Second operand has 19 states, 19 states have (on average 12.68421052631579) internal successors, (241), 19 states have internal predecessors, (241), 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-12-02 08:33:11,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:33:11,124 INFO L93 Difference]: Finished difference Result 2108 states and 2714 transitions. [2024-12-02 08:33:11,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 08:33:11,125 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.68421052631579) internal successors, (241), 19 states have internal predecessors, (241), 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 128 [2024-12-02 08:33:11,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:33:11,128 INFO L225 Difference]: With dead ends: 2108 [2024-12-02 08:33:11,128 INFO L226 Difference]: Without dead ends: 2106 [2024-12-02 08:33:11,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 56.4s TimeCoverageRelationStatistics Valid=156, Invalid=920, Unknown=62, NotChecked=268, Total=1406 [2024-12-02 08:33:11,128 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 589 mSDsluCounter, 5144 mSDsCounter, 0 mSdLazyCounter, 4599 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 5688 SdHoareTripleChecker+Invalid, 4603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:33:11,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 5688 Invalid, 4603 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4 Valid, 4599 Invalid, 0 Unknown, 0 Unchecked, 35.6s Time] [2024-12-02 08:33:11,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2024-12-02 08:33:11,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 1822. [2024-12-02 08:33:11,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1626 states have (on average 1.4440344403444034) internal successors, (2348), 1814 states have internal predecessors, (2348), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-12-02 08:33:11,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2359 transitions. [2024-12-02 08:33:11,149 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2359 transitions. Word has length 128 [2024-12-02 08:33:11,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:33:11,149 INFO L471 AbstractCegarLoop]: Abstraction has 1822 states and 2359 transitions. [2024-12-02 08:33:11,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.68421052631579) internal successors, (241), 19 states have internal predecessors, (241), 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-12-02 08:33:11,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2359 transitions. [2024-12-02 08:33:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-02 08:33:11,150 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:33:11,150 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, 1, 1, 1, 1] [2024-12-02 08:33:11,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-12-02 08:33:11,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2024-12-02 08:33:11,350 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:33:11,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:33:11,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1407225235, now seen corresponding path program 1 times [2024-12-02 08:33:11,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:33:11,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393176512] [2024-12-02 08:33:11,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:33:11,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:33:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:33:11,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 08:33:11,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:33:11,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393176512] [2024-12-02 08:33:11,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393176512] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:33:11,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076843699] [2024-12-02 08:33:11,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:33:11,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:33:11,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:33:11,786 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:33:11,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-12-02 08:33:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:33:12,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-12-02 08:33:12,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:33:12,161 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-12-02 08:33:12,192 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-12-02 08:33:14,541 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 08:33:14,542 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-12-02 08:33:14,588 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-12-02 08:33:14,731 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-12-02 08:33:14,764 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-12-02 08:33:15,388 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-12-02 08:33:15,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-12-02 08:33:16,302 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:33:16,302 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:33:16,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 08:33:16,896 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:33:16,896 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:33:16,928 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-12-02 08:33:17,426 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:33:17,426 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:33:17,459 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-12-02 08:33:17,955 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:33:17,955 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:33:17,988 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-12-02 08:33:18,530 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:33:18,531 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:33:18,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 08:33:19,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 08:33:19,080 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-12-02 08:33:19,161 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 08:33:19,161 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-12-02 08:33:19,473 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:33:19,473 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:33:19,504 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-12-02 08:33:20,226 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:33:20,226 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:33:20,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-12-02 08:33:21,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2024-12-02 08:33:21,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-12-02 08:33:23,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 08:33:23,109 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-12-02 08:33:23,366 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-12-02 08:33:23,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 26 [2024-12-02 08:33:24,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 08:33:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:33:24,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:33:26,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076843699] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:33:26,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:33:26,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 24] total 28 [2024-12-02 08:33:26,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823612342] [2024-12-02 08:33:26,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 08:33:26,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-12-02 08:33:26,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:33:26,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-12-02 08:33:26,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2024-12-02 08:33:26,212 INFO L87 Difference]: Start difference. First operand 1822 states and 2359 transitions. Second operand has 28 states, 26 states have (on average 9.423076923076923) internal successors, (245), 27 states have internal predecessors, (245), 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-12-02 08:34:23,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:34:23,754 INFO L93 Difference]: Finished difference Result 2135 states and 2745 transitions. [2024-12-02 08:34:23,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-12-02 08:34:23,755 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 9.423076923076923) internal successors, (245), 27 states have internal predecessors, (245), 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-12-02 08:34:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:34:23,757 INFO L225 Difference]: With dead ends: 2135 [2024-12-02 08:34:23,757 INFO L226 Difference]: Without dead ends: 2131 [2024-12-02 08:34:23,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=307, Invalid=2345, Unknown=0, NotChecked=0, Total=2652 [2024-12-02 08:34:23,758 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 634 mSDsluCounter, 6072 mSDsCounter, 0 mSdLazyCounter, 6206 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 6519 SdHoareTripleChecker+Invalid, 6240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 6206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.3s IncrementalHoareTripleChecker+Time [2024-12-02 08:34:23,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 6519 Invalid, 6240 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 6206 Invalid, 0 Unknown, 0 Unchecked, 52.3s Time] [2024-12-02 08:34:23,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2024-12-02 08:34:23,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 1841. [2024-12-02 08:34:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1644 states have (on average 1.4409975669099757) internal successors, (2369), 1830 states have internal predecessors, (2369), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-12-02 08:34:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2382 transitions. [2024-12-02 08:34:23,784 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2382 transitions. Word has length 130 [2024-12-02 08:34:23,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:34:23,784 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2382 transitions. [2024-12-02 08:34:23,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 9.423076923076923) internal successors, (245), 27 states have internal predecessors, (245), 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-12-02 08:34:23,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2382 transitions. [2024-12-02 08:34:23,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-02 08:34:23,784 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:34:23,785 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1] [2024-12-02 08:34:23,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-12-02 08:34:23,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2024-12-02 08:34:23,985 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:34:23,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:34:23,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1138591865, now seen corresponding path program 1 times [2024-12-02 08:34:23,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:34:23,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926927105] [2024-12-02 08:34:23,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:34:23,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:34:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:34:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 08:34:24,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:34:24,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926927105] [2024-12-02 08:34:24,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926927105] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:34:24,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906252191] [2024-12-02 08:34:24,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:34:24,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:34:24,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:34:24,759 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:34:24,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-12-02 08:34:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:34:25,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-12-02 08:34:25,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:34:25,151 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-12-02 08:34:26,446 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 08:34:26,447 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-12-02 08:34:26,611 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-12-02 08:34:26,660 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-12-02 08:34:27,273 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-12-02 08:34:27,294 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 9 treesize of output 3 [2024-12-02 08:34:28,320 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:34:28,320 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:34:28,362 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-12-02 08:34:29,058 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:34:29,058 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:34:29,097 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-12-02 08:34:29,647 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:34:29,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-12-02 08:34:29,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-12-02 08:34:30,180 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:34:30,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 08:34:30,198 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-12-02 08:34:30,714 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:34:30,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-12-02 08:34:30,732 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-12-02 08:34:31,320 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 08:34:31,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 08:34:31,711 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-12-02 08:34:31,711 INFO L378 Elim1Store]: Elim1 eliminated variable 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 96 treesize of output 62 [2024-12-02 08:34:31,728 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 50 treesize of output 31 [2024-12-02 08:34:32,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 08:34:32,598 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-12-02 08:34:32,598 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 101 treesize of output 64 [2024-12-02 08:34:32,632 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 69 treesize of output 48 [2024-12-02 08:34:34,708 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-12-02 08:34:34,708 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 50 treesize of output 25 [2024-12-02 08:34:34,724 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-12-02 08:34:36,045 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2024-12-02 08:34:36,045 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 130 treesize of output 109 [2024-12-02 08:34:36,154 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-12-02 08:34:36,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 89 [2024-12-02 08:34:36,193 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 30 treesize of output 14 [2024-12-02 08:34:37,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-12-02 08:34:37,242 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-12-02 08:34:37,662 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 08:34:37,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:34:39,220 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_5375 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem67#1.base| v_ArrVal_5375) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12))) (forall ((v_ArrVal_5376 (Array Int Int)) (v_ArrVal_5375 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem67#1.base| v_ArrVal_5375) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem67#1.base| v_ArrVal_5376) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-12-02 08:34:39,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906252191] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:34:39,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:34:39,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 24] total 29 [2024-12-02 08:34:39,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235157877] [2024-12-02 08:34:39,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 08:34:39,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-12-02 08:34:39,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:34:39,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-12-02 08:34:39,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=897, Unknown=1, NotChecked=60, Total=1056 [2024-12-02 08:34:39,231 INFO L87 Difference]: Start difference. First operand 1841 states and 2382 transitions. Second operand has 29 states, 27 states have (on average 9.148148148148149) internal successors, (247), 29 states have internal predecessors, (247), 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-12-02 08:35:41,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:35:41,748 INFO L93 Difference]: Finished difference Result 1853 states and 2393 transitions. [2024-12-02 08:35:41,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-12-02 08:35:41,748 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 9.148148148148149) internal successors, (247), 29 states have internal predecessors, (247), 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 131 [2024-12-02 08:35:41,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:35:41,750 INFO L225 Difference]: With dead ends: 1853 [2024-12-02 08:35:41,750 INFO L226 Difference]: Without dead ends: 1847 [2024-12-02 08:35:41,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=257, Invalid=2502, Unknown=1, NotChecked=102, Total=2862 [2024-12-02 08:35:41,751 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 649 mSDsluCounter, 9005 mSDsCounter, 0 mSdLazyCounter, 6547 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 9499 SdHoareTripleChecker+Invalid, 6562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 6547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.2s IncrementalHoareTripleChecker+Time [2024-12-02 08:35:41,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 9499 Invalid, 6562 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [15 Valid, 6547 Invalid, 0 Unknown, 0 Unchecked, 56.2s Time] [2024-12-02 08:35:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2024-12-02 08:35:41,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1839. [2024-12-02 08:35:41,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1643 states have (on average 1.440657334144857) internal successors, (2367), 1830 states have internal predecessors, (2367), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:35:41,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2377 transitions. [2024-12-02 08:35:41,768 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2377 transitions. Word has length 131 [2024-12-02 08:35:41,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:35:41,768 INFO L471 AbstractCegarLoop]: Abstraction has 1839 states and 2377 transitions. [2024-12-02 08:35:41,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 9.148148148148149) internal successors, (247), 29 states have internal predecessors, (247), 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-12-02 08:35:41,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2377 transitions. [2024-12-02 08:35:41,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-02 08:35:41,769 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:35:41,769 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1] [2024-12-02 08:35:41,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-12-02 08:35:41,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:35:41,970 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:35:41,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:35:41,970 INFO L85 PathProgramCache]: Analyzing trace with hash -195138029, now seen corresponding path program 2 times [2024-12-02 08:35:41,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:35:41,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861081152] [2024-12-02 08:35:41,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 08:35:41,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:35:42,002 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 08:35:42,002 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 08:35:42,779 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-02 08:35:42,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:35:42,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861081152] [2024-12-02 08:35:42,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861081152] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:35:42,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:35:42,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 08:35:42,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936077616] [2024-12-02 08:35:42,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:35:42,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 08:35:42,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:35:42,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 08:35:42,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:35:42,781 INFO L87 Difference]: Start difference. First operand 1839 states and 2377 transitions. Second operand has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 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-12-02 08:35:46,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:35:46,441 INFO L93 Difference]: Finished difference Result 1864 states and 2402 transitions. [2024-12-02 08:35:46,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 08:35:46,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 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 134 [2024-12-02 08:35:46,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:35:46,444 INFO L225 Difference]: With dead ends: 1864 [2024-12-02 08:35:46,444 INFO L226 Difference]: Without dead ends: 1864 [2024-12-02 08:35:46,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-12-02 08:35:46,445 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 40 mSDsluCounter, 2644 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3369 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-12-02 08:35:46,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3369 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-12-02 08:35:46,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2024-12-02 08:35:46,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1859. [2024-12-02 08:35:46,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1663 states have (on average 1.4353577871316898) internal successors, (2387), 1850 states have internal predecessors, (2387), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:35:46,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2397 transitions. [2024-12-02 08:35:46,462 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2397 transitions. Word has length 134 [2024-12-02 08:35:46,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:35:46,463 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2397 transitions. [2024-12-02 08:35:46,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 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-12-02 08:35:46,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2397 transitions. [2024-12-02 08:35:46,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-12-02 08:35:46,463 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:35:46,463 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1] [2024-12-02 08:35:46,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-12-02 08:35:46,464 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:35:46,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:35:46,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1894579468, now seen corresponding path program 1 times [2024-12-02 08:35:46,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:35:46,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16714369] [2024-12-02 08:35:46,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:35:46,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:35:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:35:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-02 08:35:47,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:35:47,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16714369] [2024-12-02 08:35:47,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16714369] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:35:47,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:35:47,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 08:35:47,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885097512] [2024-12-02 08:35:47,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:35:47,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 08:35:47,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:35:47,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 08:35:47,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 08:35:47,606 INFO L87 Difference]: Start difference. First operand 1859 states and 2397 transitions. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 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-12-02 08:35:51,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:35:51,797 INFO L93 Difference]: Finished difference Result 1884 states and 2427 transitions. [2024-12-02 08:35:51,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 08:35:51,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 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 135 [2024-12-02 08:35:51,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:35:51,799 INFO L225 Difference]: With dead ends: 1884 [2024-12-02 08:35:51,799 INFO L226 Difference]: Without dead ends: 1884 [2024-12-02 08:35:51,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:35:51,799 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 9 mSDsluCounter, 3259 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3991 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:35:51,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3991 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-12-02 08:35:51,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2024-12-02 08:35:51,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1879. [2024-12-02 08:35:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1683 states have (on average 1.4331550802139037) internal successors, (2412), 1870 states have internal predecessors, (2412), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:35:51,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2422 transitions. [2024-12-02 08:35:51,818 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2422 transitions. Word has length 135 [2024-12-02 08:35:51,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:35:51,818 INFO L471 AbstractCegarLoop]: Abstraction has 1879 states and 2422 transitions. [2024-12-02 08:35:51,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 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-12-02 08:35:51,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2422 transitions. [2024-12-02 08:35:51,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-12-02 08:35:51,819 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:35:51,819 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1] [2024-12-02 08:35:51,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-12-02 08:35:51,819 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:35:51,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:35:51,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1878717280, now seen corresponding path program 1 times [2024-12-02 08:35:51,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:35:51,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681041601] [2024-12-02 08:35:51,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:35:51,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:35:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:35:52,757 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-02 08:35:52,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:35:52,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681041601] [2024-12-02 08:35:52,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681041601] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:35:52,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:35:52,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 08:35:52,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057364427] [2024-12-02 08:35:52,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:35:52,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 08:35:52,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:35:52,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 08:35:52,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:35:52,759 INFO L87 Difference]: Start difference. First operand 1879 states and 2422 transitions. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 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-12-02 08:35:56,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:35:56,657 INFO L93 Difference]: Finished difference Result 1904 states and 2452 transitions. [2024-12-02 08:35:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 08:35:56,658 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 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 135 [2024-12-02 08:35:56,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:35:56,659 INFO L225 Difference]: With dead ends: 1904 [2024-12-02 08:35:56,659 INFO L226 Difference]: Without dead ends: 1904 [2024-12-02 08:35:56,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-12-02 08:35:56,660 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 10 mSDsluCounter, 3938 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4663 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-12-02 08:35:56,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4663 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-12-02 08:35:56,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2024-12-02 08:35:56,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1879. [2024-12-02 08:35:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1683 states have (on average 1.4331550802139037) internal successors, (2412), 1870 states have internal predecessors, (2412), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:35:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2422 transitions. [2024-12-02 08:35:56,672 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2422 transitions. Word has length 135 [2024-12-02 08:35:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:35:56,673 INFO L471 AbstractCegarLoop]: Abstraction has 1879 states and 2422 transitions. [2024-12-02 08:35:56,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 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-12-02 08:35:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2422 transitions. [2024-12-02 08:35:56,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-12-02 08:35:56,673 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:35:56,673 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1] [2024-12-02 08:35:56,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-12-02 08:35:56,673 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:35:56,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:35:56,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1243230239, now seen corresponding path program 1 times [2024-12-02 08:35:56,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:35:56,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770224322] [2024-12-02 08:35:56,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:35:56,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:35:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:35:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-02 08:35:57,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:35:57,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770224322] [2024-12-02 08:35:57,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770224322] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:35:57,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:35:57,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 08:35:57,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718375282] [2024-12-02 08:35:57,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:35:57,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 08:35:57,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:35:57,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 08:35:57,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-12-02 08:35:57,881 INFO L87 Difference]: Start difference. First operand 1879 states and 2422 transitions. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 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-12-02 08:36:03,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:36:03,629 INFO L93 Difference]: Finished difference Result 1934 states and 2492 transitions. [2024-12-02 08:36:03,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 08:36:03,630 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 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 136 [2024-12-02 08:36:03,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:36:03,631 INFO L225 Difference]: With dead ends: 1934 [2024-12-02 08:36:03,631 INFO L226 Difference]: Without dead ends: 1934 [2024-12-02 08:36:03,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-12-02 08:36:03,632 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 28 mSDsluCounter, 4710 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 5443 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-12-02 08:36:03,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 5443 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-12-02 08:36:03,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2024-12-02 08:36:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1919. [2024-12-02 08:36:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1919 states, 1723 states have (on average 1.42890307603018) internal successors, (2462), 1910 states have internal predecessors, (2462), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:36:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 2472 transitions. [2024-12-02 08:36:03,648 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 2472 transitions. Word has length 136 [2024-12-02 08:36:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:36:03,648 INFO L471 AbstractCegarLoop]: Abstraction has 1919 states and 2472 transitions. [2024-12-02 08:36:03,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 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-12-02 08:36:03,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 2472 transitions. [2024-12-02 08:36:03,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-02 08:36:03,649 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:36:03,649 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1] [2024-12-02 08:36:03,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-12-02 08:36:03,649 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:36:03,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:36:03,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1561513565, now seen corresponding path program 1 times [2024-12-02 08:36:03,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:36:03,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240307994] [2024-12-02 08:36:03,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:36:03,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:36:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:36:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-02 08:36:04,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:36:04,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240307994] [2024-12-02 08:36:04,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240307994] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:36:04,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703045801] [2024-12-02 08:36:04,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:36:04,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:36:04,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:36:04,395 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:36:04,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-12-02 08:36:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:36:04,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-12-02 08:36:04,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:36:04,805 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-12-02 08:36:04,851 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-12-02 08:36:07,392 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-12-02 08:36:07,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-12-02 08:36:07,506 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 08:36:07,506 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-12-02 08:36:07,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 08:36:08,257 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-12-02 08:36:09,159 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:36:09,159 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:36:09,704 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:36:09,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 08:36:10,167 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:36:10,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 08:36:10,698 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:36:10,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 08:36:11,239 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:36:11,239 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:36:11,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 08:36:11,757 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-12-02 08:36:11,845 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 08:36:11,845 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-12-02 08:36:12,282 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:36:12,282 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:36:13,300 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:36:13,301 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:36:13,323 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-12-02 08:36:14,478 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-12-02 08:36:14,574 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-12-02 08:36:17,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 08:36:17,083 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-12-02 08:36:17,416 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-12-02 08:36:17,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 26 [2024-12-02 08:36:18,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 08:36:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 08:36:18,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:36:20,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703045801] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:36:20,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:36:20,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 24] total 30 [2024-12-02 08:36:20,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971174935] [2024-12-02 08:36:20,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 08:36:20,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-12-02 08:36:20,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:36:20,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-12-02 08:36:20,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1012, Unknown=0, NotChecked=0, Total=1122 [2024-12-02 08:36:20,404 INFO L87 Difference]: Start difference. First operand 1919 states and 2472 transitions. Second operand has 30 states, 29 states have (on average 8.827586206896552) internal successors, (256), 29 states have internal predecessors, (256), 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-12-02 08:37:10,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:37:10,099 INFO L93 Difference]: Finished difference Result 2209 states and 2830 transitions. [2024-12-02 08:37:10,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-12-02 08:37:10,100 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 8.827586206896552) internal successors, (256), 29 states have internal predecessors, (256), 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 137 [2024-12-02 08:37:10,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:37:10,102 INFO L225 Difference]: With dead ends: 2209 [2024-12-02 08:37:10,102 INFO L226 Difference]: Without dead ends: 2207 [2024-12-02 08:37:10,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=323, Invalid=2647, Unknown=0, NotChecked=0, Total=2970 [2024-12-02 08:37:10,102 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 632 mSDsluCounter, 4910 mSDsCounter, 0 mSdLazyCounter, 5193 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 5357 SdHoareTripleChecker+Invalid, 5231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 5193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.9s IncrementalHoareTripleChecker+Time [2024-12-02 08:37:10,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 5357 Invalid, 5231 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 5193 Invalid, 0 Unknown, 0 Unchecked, 43.9s Time] [2024-12-02 08:37:10,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2024-12-02 08:37:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 1920. [2024-12-02 08:37:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1920 states, 1724 states have (on average 1.427494199535963) internal successors, (2461), 1911 states have internal predecessors, (2461), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:37:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 2471 transitions. [2024-12-02 08:37:10,120 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 2471 transitions. Word has length 137 [2024-12-02 08:37:10,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:37:10,120 INFO L471 AbstractCegarLoop]: Abstraction has 1920 states and 2471 transitions. [2024-12-02 08:37:10,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 8.827586206896552) internal successors, (256), 29 states have internal predecessors, (256), 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-12-02 08:37:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2471 transitions. [2024-12-02 08:37:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-12-02 08:37:10,121 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:37:10,121 INFO L218 NwaCegarLoop]: trace histogram [7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:37:10,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-12-02 08:37:10,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2024-12-02 08:37:10,321 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:37:10,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:37:10,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1344112263, now seen corresponding path program 1 times [2024-12-02 08:37:10,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 08:37:10,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272938622] [2024-12-02 08:37:10,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:37:10,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 08:37:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:37:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-02 08:37:11,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 08:37:11,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272938622] [2024-12-02 08:37:11,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272938622] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:37:11,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57011427] [2024-12-02 08:37:11,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:37:11,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:37:11,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:37:11,199 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:37:11,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-12-02 08:37:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:37:11,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-12-02 08:37:11,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:37:11,621 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-12-02 08:37:11,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-02 08:37:14,165 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 08:37:14,165 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-12-02 08:37:14,196 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-12-02 08:37:14,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 08:37:14,994 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-12-02 08:37:15,929 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:37:15,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 31 treesize of output 32 [2024-12-02 08:37:16,566 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:37:16,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 31 treesize of output 32 [2024-12-02 08:37:17,087 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:37:17,087 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:37:17,636 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:37:17,636 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:37:18,168 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:37:18,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 08:37:18,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 08:37:18,646 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-12-02 08:37:18,732 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 08:37:18,732 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-12-02 08:37:19,075 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:37:19,075 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:37:19,862 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:37:19,862 INFO L378 Elim1Store]: Elim1 eliminated variable 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-12-02 08:37:20,242 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-12-02 08:37:26,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 08:37:26,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-12-02 08:37:26,916 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-12-02 08:37:26,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 26 [2024-12-02 08:37:28,476 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 08:37:28,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 42 treesize of output 41 [2024-12-02 08:37:28,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 08:37:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-02 08:37:28,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 08:37:29,771 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6514 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem77#1.base| v_ArrVal_6514) |c_ULTIMATE.start_main_~users~0#1.base|) (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) 1)) is different from false [2024-12-02 08:37:30,645 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6514 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-12-02 08:37:31,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57011427] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 08:37:31,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 08:37:31,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 23] total 30 [2024-12-02 08:37:31,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902668005] [2024-12-02 08:37:31,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 08:37:31,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-12-02 08:37:31,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 08:37:31,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-12-02 08:37:31,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1000, Unknown=22, NotChecked=130, Total=1260 [2024-12-02 08:37:31,561 INFO L87 Difference]: Start difference. First operand 1920 states and 2471 transitions. Second operand has 30 states, 29 states have (on average 9.206896551724139) internal successors, (267), 29 states have internal predecessors, (267), 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-12-02 08:37:48,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 08:37:54,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 08:38:02,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 08:38:07,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 08:38:12,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 08:38:17,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 08:38:21,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 08:38:25,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 08:38:29,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 08:38:31,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 08:38:35,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-12-02 08:38:39,606 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-12-02 08:38:39,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-12-02 08:38:39,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=320, Invalid=2636, Unknown=22, NotChecked=214, Total=3192 [2024-12-02 08:38:39,607 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 153 mSDsluCounter, 2283 mSDsCounter, 0 mSdLazyCounter, 1554 mSolverCounterSat, 16 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 2431 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1554 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.5s IncrementalHoareTripleChecker+Time [2024-12-02 08:38:39,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 2431 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1554 Invalid, 8 Unknown, 0 Unchecked, 58.5s Time] [2024-12-02 08:38:39,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-12-02 08:38:39,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:38:39,808 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:665) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1708) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:762) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:388) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2024-12-02 08:38:39,812 INFO L158 Benchmark]: Toolchain (without parser) took 811714.87ms. Allocated memory was 117.4MB in the beginning and 947.9MB in the end (delta: 830.5MB). Free memory was 90.0MB in the beginning and 594.8MB in the end (delta: -504.8MB). Peak memory consumption was 332.2MB. Max. memory is 16.1GB. [2024-12-02 08:38:39,812 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 08:38:39,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.26ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 56.8MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-12-02 08:38:39,812 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.33ms. Allocated memory is still 117.4MB. Free memory was 56.5MB in the beginning and 49.1MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 08:38:39,812 INFO L158 Benchmark]: Boogie Preprocessor took 128.95ms. Allocated memory is still 117.4MB. Free memory was 49.1MB in the beginning and 85.1MB in the end (delta: -36.0MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2024-12-02 08:38:39,812 INFO L158 Benchmark]: RCFGBuilder took 2274.33ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 85.1MB in the beginning and 176.0MB in the end (delta: -91.0MB). Peak memory consumption was 127.4MB. Max. memory is 16.1GB. [2024-12-02 08:38:39,812 INFO L158 Benchmark]: TraceAbstraction took 808716.10ms. Allocated memory was 218.1MB in the beginning and 947.9MB in the end (delta: 729.8MB). Free memory was 176.0MB in the beginning and 594.8MB in the end (delta: -418.8MB). Peak memory consumption was 313.3MB. Max. memory is 16.1GB. [2024-12-02 08:38:39,813 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 514.26ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 56.8MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.33ms. Allocated memory is still 117.4MB. Free memory was 56.5MB in the beginning and 49.1MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 128.95ms. Allocated memory is still 117.4MB. Free memory was 49.1MB in the beginning and 85.1MB in the end (delta: -36.0MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2274.33ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 85.1MB in the beginning and 176.0MB in the end (delta: -91.0MB). Peak memory consumption was 127.4MB. Max. memory is 16.1GB. * TraceAbstraction took 808716.10ms. Allocated memory was 218.1MB in the beginning and 947.9MB in the end (delta: 729.8MB). Free memory was 176.0MB in the beginning and 594.8MB in the end (delta: -418.8MB). Peak memory consumption was 313.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1 --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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 08:38:41,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 08:38:41,926 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-12-02 08:38:41,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 08:38:41,933 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 08:38:41,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 08:38:41,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 08:38:41,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 08:38:41,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 08:38:41,956 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 08:38:41,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 08:38:41,957 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 08:38:41,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 08:38:41,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 08:38:41,957 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 08:38:41,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 08:38:41,957 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 08:38:41,957 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 08:38:41,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 08:38:41,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 08:38:41,958 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 08:38:41,958 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 08:38:41,958 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 08:38:41,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 08:38:41,958 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 08:38:41,958 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-12-02 08:38:41,958 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-12-02 08:38:41,958 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 08:38:41,958 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 08:38:41,958 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 08:38:41,958 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 08:38:41,959 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 08:38:41,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 08:38:41,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 08:38:41,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 08:38:41,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 08:38:41,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 08:38:41,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 08:38:41,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 08:38:41,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 08:38:41,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 08:38:41,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 08:38:41,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 08:38:41,960 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-12-02 08:38:41,960 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-12-02 08:38:41,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 08:38:41,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 08:38:41,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 08:38:41,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 08:38:41,961 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_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1 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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-12-02 08:38:42,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 08:38:42,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 08:38:42,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 08:38:42,219 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 08:38:42,219 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 08:38:42,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i [2024-12-02 08:38:44,911 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/data/ec5cb17ee/dc293c666bd848c086e7ad50119e7c2a/FLAG085fca116 [2024-12-02 08:38:45,175 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 08:38:45,176 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i [2024-12-02 08:38:45,190 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/data/ec5cb17ee/dc293c666bd848c086e7ad50119e7c2a/FLAG085fca116 [2024-12-02 08:38:45,463 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/data/ec5cb17ee/dc293c666bd848c086e7ad50119e7c2a [2024-12-02 08:38:45,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 08:38:45,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 08:38:45,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 08:38:45,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 08:38:45,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 08:38:45,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:38:45" (1/1) ... [2024-12-02 08:38:45,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59588f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:45, skipping insertion in model container [2024-12-02 08:38:45,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:38:45" (1/1) ... [2024-12-02 08:38:45,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 08:38:45,791 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 08:38:45,823 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 08:38:45,828 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 08:38:45,833 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 08:38:45,841 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 08:38:45,875 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 08:38:45,875 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 08:38:45,878 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 08:38:45,878 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 08:38:45,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 08:38:45,897 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 08:38:45,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 08:38:46,033 INFO L204 MainTranslator]: Completed translation [2024-12-02 08:38:46,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:46 WrapperNode [2024-12-02 08:38:46,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 08:38:46,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 08:38:46,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 08:38:46,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 08:38:46,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:46" (1/1) ... [2024-12-02 08:38:46,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:46" (1/1) ... [2024-12-02 08:38:46,099 INFO L138 Inliner]: procedures = 210, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 862 [2024-12-02 08:38:46,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 08:38:46,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 08:38:46,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 08:38:46,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 08:38:46,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:46" (1/1) ... [2024-12-02 08:38:46,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:46" (1/1) ... [2024-12-02 08:38:46,117 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:46" (1/1) ... [2024-12-02 08:38:46,158 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 170, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2024-12-02 08:38:46,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:46" (1/1) ... [2024-12-02 08:38:46,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:46" (1/1) ... [2024-12-02 08:38:46,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:46" (1/1) ... [2024-12-02 08:38:46,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:46" (1/1) ... [2024-12-02 08:38:46,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:46" (1/1) ... [2024-12-02 08:38:46,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:46" (1/1) ... [2024-12-02 08:38:46,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:46" (1/1) ... [2024-12-02 08:38:46,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 08:38:46,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 08:38:46,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 08:38:46,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 08:38:46,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:46" (1/1) ... [2024-12-02 08:38:46,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 08:38:46,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:38:46,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 08:38:46,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 08:38:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-12-02 08:38:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-12-02 08:38:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-12-02 08:38:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-12-02 08:38:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-12-02 08:38:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-12-02 08:38:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-12-02 08:38:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-12-02 08:38:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-12-02 08:38:46,276 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-12-02 08:38:46,276 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-12-02 08:38:46,276 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-12-02 08:38:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-02 08:38:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-12-02 08:38:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-12-02 08:38:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-12-02 08:38:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-12-02 08:38:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-12-02 08:38:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-12-02 08:38:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-02 08:38:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-12-02 08:38:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-12-02 08:38:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-12-02 08:38:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-02 08:38:46,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 08:38:46,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-12-02 08:38:46,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-12-02 08:38:46,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-12-02 08:38:46,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 08:38:46,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 08:38:46,452 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 08:38:46,454 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 08:38:46,457 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-12-02 08:38:46,521 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-12-02 08:38:46,545 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-12-02 08:38:49,716 INFO L? ?]: Removed 864 outVars from TransFormulas that were not future-live. [2024-12-02 08:38:49,716 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 08:38:49,740 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 08:38:49,740 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2024-12-02 08:38:49,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:38:49 BoogieIcfgContainer [2024-12-02 08:38:49,741 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 08:38:49,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 08:38:49,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 08:38:49,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 08:38:49,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:38:45" (1/3) ... [2024-12-02 08:38:49,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385b3270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:38:49, skipping insertion in model container [2024-12-02 08:38:49,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:46" (2/3) ... [2024-12-02 08:38:49,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385b3270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:38:49, skipping insertion in model container [2024-12-02 08:38:49,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:38:49" (3/3) ... [2024-12-02 08:38:49,750 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test2-1.i [2024-12-02 08:38:49,764 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 08:38:49,766 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_nondet_test2-1.i that has 4 procedures, 870 locations, 1 initial locations, 33 loop locations, and 420 error locations. [2024-12-02 08:38:49,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 08:38:49,822 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;@43bdb60b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 08:38:49,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-12-02 08:38:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 860 states, 438 states have (on average 2.1940639269406392) internal successors, (961), 855 states have internal predecessors, (961), 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-12-02 08:38:49,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-02 08:38:49,832 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:38:49,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-12-02 08:38:49,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:38:49,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:38:49,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1758160, now seen corresponding path program 1 times [2024-12-02 08:38:49,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 08:38:49,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1614247919] [2024-12-02 08:38:49,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:38:49,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:38:49,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:38:49,850 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:38:49,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 08:38:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:38:49,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 08:38:49,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:38:50,051 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_46| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_46|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_46| (_ bv0 1)) |c_#valid|))) is different from true [2024-12-02 08:38:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:38:50,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 08:38:50,055 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 08:38:50,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614247919] [2024-12-02 08:38:50,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614247919] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:38:50,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:38:50,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:38:50,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819931353] [2024-12-02 08:38:50,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:38:50,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:38:50,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 08:38:50,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:38:50,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-12-02 08:38:50,082 INFO L87 Difference]: Start difference. First operand has 860 states, 438 states have (on average 2.1940639269406392) internal successors, (961), 855 states have internal predecessors, (961), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-12-02 08:38:51,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:38:51,520 INFO L93 Difference]: Finished difference Result 1064 states and 1144 transitions. [2024-12-02 08:38:51,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:38:51,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-12-02 08:38:51,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:38:51,534 INFO L225 Difference]: With dead ends: 1064 [2024-12-02 08:38:51,534 INFO L226 Difference]: Without dead ends: 1061 [2024-12-02 08:38:51,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-12-02 08:38:51,538 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 234 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1145 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-12-02 08:38:51,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1251 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 540 Invalid, 0 Unknown, 1145 Unchecked, 1.4s Time] [2024-12-02 08:38:51,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2024-12-02 08:38:51,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 848. [2024-12-02 08:38:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 432 states have (on average 2.0555555555555554) internal successors, (888), 843 states have internal predecessors, (888), 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-12-02 08:38:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 894 transitions. [2024-12-02 08:38:51,601 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 894 transitions. Word has length 4 [2024-12-02 08:38:51,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:38:51,601 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 894 transitions. [2024-12-02 08:38:51,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-12-02 08:38:51,601 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 894 transitions. [2024-12-02 08:38:51,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-02 08:38:51,602 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:38:51,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-12-02 08:38:51,609 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 08:38:51,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:38:51,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:38:51,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:38:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-12-02 08:38:51,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 08:38:51,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1683370565] [2024-12-02 08:38:51,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:38:51,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:38:51,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:38:51,805 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:38:51,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 08:38:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:38:51,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 08:38:51,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:38:51,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-12-02 08:38:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:38:51,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 08:38:51,923 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 08:38:51,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683370565] [2024-12-02 08:38:51,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683370565] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:38:51,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:38:51,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 08:38:51,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166380105] [2024-12-02 08:38:51,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:38:51,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:38:51,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 08:38:51,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:38:51,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:38:51,925 INFO L87 Difference]: Start difference. First operand 848 states and 894 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-12-02 08:38:52,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:38:52,966 INFO L93 Difference]: Finished difference Result 845 states and 892 transitions. [2024-12-02 08:38:52,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:38:52,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-12-02 08:38:52,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:38:52,969 INFO L225 Difference]: With dead ends: 845 [2024-12-02 08:38:52,969 INFO L226 Difference]: Without dead ends: 845 [2024-12-02 08:38:52,969 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-12-02 08:38:52,970 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 776 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-12-02 08:38:52,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 551 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-12-02 08:38:52,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-12-02 08:38:52,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2024-12-02 08:38:52,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 440 states have (on average 2.0136363636363637) internal successors, (886), 840 states have internal predecessors, (886), 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-12-02 08:38:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 892 transitions. [2024-12-02 08:38:52,984 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 892 transitions. Word has length 4 [2024-12-02 08:38:52,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:38:52,984 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 892 transitions. [2024-12-02 08:38:52,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-12-02 08:38:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 892 transitions. [2024-12-02 08:38:52,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-02 08:38:52,984 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:38:52,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-12-02 08:38:52,990 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 08:38:53,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:38:53,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:38:53,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:38:53,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-12-02 08:38:53,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 08:38:53,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1619629275] [2024-12-02 08:38:53,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:38:53,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:38:53,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:38:53,187 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:38:53,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 08:38:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:38:53,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 08:38:53,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:38:53,275 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-12-02 08:38:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:38:53,297 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 08:38:53,297 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 08:38:53,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619629275] [2024-12-02 08:38:53,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619629275] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:38:53,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:38:53,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 08:38:53,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829294615] [2024-12-02 08:38:53,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:38:53,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:38:53,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 08:38:53,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:38:53,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:38:53,299 INFO L87 Difference]: Start difference. First operand 845 states and 892 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-12-02 08:38:54,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:38:54,950 INFO L93 Difference]: Finished difference Result 1057 states and 1125 transitions. [2024-12-02 08:38:54,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:38:54,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-12-02 08:38:54,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:38:54,953 INFO L225 Difference]: With dead ends: 1057 [2024-12-02 08:38:54,953 INFO L226 Difference]: Without dead ends: 1057 [2024-12-02 08:38:54,954 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-12-02 08:38:54,954 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 233 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:38:54,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1253 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-12-02 08:38:54,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2024-12-02 08:38:54,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 970. [2024-12-02 08:38:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 566 states have (on average 1.969964664310954) internal successors, (1115), 965 states have internal predecessors, (1115), 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-12-02 08:38:54,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1121 transitions. [2024-12-02 08:38:54,969 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1121 transitions. Word has length 4 [2024-12-02 08:38:54,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:38:54,969 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1121 transitions. [2024-12-02 08:38:54,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-12-02 08:38:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1121 transitions. [2024-12-02 08:38:54,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-02 08:38:54,970 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:38:54,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:38:54,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 08:38:55,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:38:55,171 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:38:55,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:38:55,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1599592659, now seen corresponding path program 1 times [2024-12-02 08:38:55,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 08:38:55,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1583039464] [2024-12-02 08:38:55,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:38:55,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:38:55,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:38:55,173 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:38:55,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 08:38:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:38:55,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-12-02 08:38:55,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:38:55,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-12-02 08:38:55,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-12-02 08:38:55,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 08:38:55,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2024-12-02 08:38:55,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 08:38:55,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-12-02 08:38:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:38:55,433 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 08:38:55,433 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 08:38:55,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583039464] [2024-12-02 08:38:55,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583039464] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:38:55,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:38:55,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:38:55,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413247474] [2024-12-02 08:38:55,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:38:55,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:38:55,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 08:38:55,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:38:55,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:38:55,434 INFO L87 Difference]: Start difference. First operand 970 states and 1121 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:39:00,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:39:00,088 INFO L93 Difference]: Finished difference Result 2019 states and 2239 transitions. [2024-12-02 08:39:00,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:39:00,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-12-02 08:39:00,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:39:00,093 INFO L225 Difference]: With dead ends: 2019 [2024-12-02 08:39:00,093 INFO L226 Difference]: Without dead ends: 2019 [2024-12-02 08:39:00,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-12-02 08:39:00,094 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 1399 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 1845 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-12-02 08:39:00,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1402 Valid, 1034 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1845 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-12-02 08:39:00,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2024-12-02 08:39:00,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 1157. [2024-12-02 08:39:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 753 states have (on average 1.9707835325365206) internal successors, (1484), 1150 states have internal predecessors, (1484), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:39:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1494 transitions. [2024-12-02 08:39:00,129 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1494 transitions. Word has length 9 [2024-12-02 08:39:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:39:00,130 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1494 transitions. [2024-12-02 08:39:00,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:39:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1494 transitions. [2024-12-02 08:39:00,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-02 08:39:00,130 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:39:00,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:39:00,140 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 08:39:00,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:39:00,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:39:00,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:39:00,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1952235122, now seen corresponding path program 1 times [2024-12-02 08:39:00,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 08:39:00,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1638112452] [2024-12-02 08:39:00,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:39:00,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:39:00,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:39:00,334 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:39:00,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 08:39:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:39:00,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 08:39:00,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:39:00,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-12-02 08:39:00,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:39:00,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 08:39:00,454 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 08:39:00,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638112452] [2024-12-02 08:39:00,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638112452] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:39:00,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:39:00,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 08:39:00,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428399150] [2024-12-02 08:39:00,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:39:00,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:39:00,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 08:39:00,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:39:00,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:39:00,455 INFO L87 Difference]: Start difference. First operand 1157 states and 1494 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:39:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:39:02,062 INFO L93 Difference]: Finished difference Result 1323 states and 1657 transitions. [2024-12-02 08:39:02,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:39:02,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-12-02 08:39:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:39:02,067 INFO L225 Difference]: With dead ends: 1323 [2024-12-02 08:39:02,067 INFO L226 Difference]: Without dead ends: 1323 [2024-12-02 08:39:02,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-12-02 08:39:02,068 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 761 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:39:02,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 815 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-12-02 08:39:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2024-12-02 08:39:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1110. [2024-12-02 08:39:02,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 753 states have (on average 1.8764940239043826) internal successors, (1413), 1103 states have internal predecessors, (1413), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:39:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1423 transitions. [2024-12-02 08:39:02,096 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1423 transitions. Word has length 10 [2024-12-02 08:39:02,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:39:02,096 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1423 transitions. [2024-12-02 08:39:02,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:39:02,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1423 transitions. [2024-12-02 08:39:02,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-02 08:39:02,097 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:39:02,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:39:02,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 08:39:02,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:39:02,297 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:39:02,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:39:02,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1952235123, now seen corresponding path program 1 times [2024-12-02 08:39:02,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 08:39:02,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [392281762] [2024-12-02 08:39:02,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:39:02,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:39:02,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:39:02,300 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:39:02,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 08:39:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:39:02,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 08:39:02,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:39:02,411 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-12-02 08:39:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:39:02,447 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 08:39:02,447 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 08:39:02,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392281762] [2024-12-02 08:39:02,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392281762] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:39:02,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:39:02,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 08:39:02,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459984760] [2024-12-02 08:39:02,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:39:02,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 08:39:02,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 08:39:02,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 08:39:02,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 08:39:02,448 INFO L87 Difference]: Start difference. First operand 1110 states and 1423 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:39:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:39:04,121 INFO L93 Difference]: Finished difference Result 1582 states and 2049 transitions. [2024-12-02 08:39:04,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 08:39:04,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-12-02 08:39:04,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:39:04,124 INFO L225 Difference]: With dead ends: 1582 [2024-12-02 08:39:04,124 INFO L226 Difference]: Without dead ends: 1582 [2024-12-02 08:39:04,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-12-02 08:39:04,124 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 514 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-12-02 08:39:04,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1159 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-12-02 08:39:04,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2024-12-02 08:39:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1172. [2024-12-02 08:39:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 825 states have (on average 1.8654545454545455) internal successors, (1539), 1165 states have internal predecessors, (1539), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:39:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1549 transitions. [2024-12-02 08:39:04,152 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1549 transitions. Word has length 10 [2024-12-02 08:39:04,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:39:04,152 INFO L471 AbstractCegarLoop]: Abstraction has 1172 states and 1549 transitions. [2024-12-02 08:39:04,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:39:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1549 transitions. [2024-12-02 08:39:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-02 08:39:04,152 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:39:04,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:39:04,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 08:39:04,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:39:04,353 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:39:04,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:39:04,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1317380992, now seen corresponding path program 1 times [2024-12-02 08:39:04,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 08:39:04,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1920531521] [2024-12-02 08:39:04,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:39:04,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:39:04,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:39:04,355 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:39:04,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 08:39:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:39:04,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 08:39:04,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:39:04,534 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_47| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_47| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_47|)))) is different from true [2024-12-02 08:39:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:39:04,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 08:39:04,535 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 08:39:04,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920531521] [2024-12-02 08:39:04,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920531521] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:39:04,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:39:04,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:39:04,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16556850] [2024-12-02 08:39:04,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:39:04,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:39:04,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 08:39:04,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:39:04,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-12-02 08:39:04,536 INFO L87 Difference]: Start difference. First operand 1172 states and 1549 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:39:05,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:39:05,683 INFO L93 Difference]: Finished difference Result 1386 states and 1783 transitions. [2024-12-02 08:39:05,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:39:05,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-12-02 08:39:05,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:39:05,687 INFO L225 Difference]: With dead ends: 1386 [2024-12-02 08:39:05,687 INFO L226 Difference]: Without dead ends: 1384 [2024-12-02 08:39:05,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-12-02 08:39:05,688 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 227 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1058 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-12-02 08:39:05,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1183 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 464 Invalid, 0 Unknown, 1058 Unchecked, 1.1s Time] [2024-12-02 08:39:05,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-12-02 08:39:05,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1298. [2024-12-02 08:39:05,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 951 states have (on average 1.8590956887486856) internal successors, (1768), 1291 states have internal predecessors, (1768), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:39:05,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1778 transitions. [2024-12-02 08:39:05,706 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1778 transitions. Word has length 11 [2024-12-02 08:39:05,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:39:05,706 INFO L471 AbstractCegarLoop]: Abstraction has 1298 states and 1778 transitions. [2024-12-02 08:39:05,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:39:05,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1778 transitions. [2024-12-02 08:39:05,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-02 08:39:05,706 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:39:05,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:39:05,713 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 08:39:05,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:39:05,907 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:39:05,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:39:05,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1789694881, now seen corresponding path program 1 times [2024-12-02 08:39:05,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 08:39:05,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [339451828] [2024-12-02 08:39:05,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:39:05,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:39:05,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:39:05,909 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:39:05,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 08:39:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:39:06,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 08:39:06,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:39:06,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:39:06,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 08:39:06,058 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 08:39:06,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339451828] [2024-12-02 08:39:06,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339451828] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:39:06,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:39:06,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:39:06,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236498172] [2024-12-02 08:39:06,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:39:06,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:39:06,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 08:39:06,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:39:06,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:39:06,059 INFO L87 Difference]: Start difference. First operand 1298 states and 1778 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:39:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:39:07,485 INFO L93 Difference]: Finished difference Result 1287 states and 1721 transitions. [2024-12-02 08:39:07,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:39:07,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-12-02 08:39:07,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:39:07,489 INFO L225 Difference]: With dead ends: 1287 [2024-12-02 08:39:07,489 INFO L226 Difference]: Without dead ends: 1287 [2024-12-02 08:39:07,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-12-02 08:39:07,489 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 775 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-12-02 08:39:07,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 882 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-12-02 08:39:07,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2024-12-02 08:39:07,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1275. [2024-12-02 08:39:07,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 951 states have (on average 1.786540483701367) internal successors, (1699), 1268 states have internal predecessors, (1699), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:39:07,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1709 transitions. [2024-12-02 08:39:07,513 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1709 transitions. Word has length 14 [2024-12-02 08:39:07,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:39:07,514 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 1709 transitions. [2024-12-02 08:39:07,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:39:07,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1709 transitions. [2024-12-02 08:39:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-02 08:39:07,514 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:39:07,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:39:07,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-12-02 08:39:07,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:39:07,715 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr331REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:39:07,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:39:07,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1789694880, now seen corresponding path program 1 times [2024-12-02 08:39:07,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 08:39:07,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124640097] [2024-12-02 08:39:07,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:39:07,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:39:07,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:39:07,717 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:39:07,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 08:39:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:39:07,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 08:39:07,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:39:07,809 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-12-02 08:39:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:39:07,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 08:39:07,898 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 08:39:07,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124640097] [2024-12-02 08:39:07,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124640097] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:39:07,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:39:07,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:39:07,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469353550] [2024-12-02 08:39:07,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:39:07,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:39:07,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 08:39:07,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:39:07,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:39:07,899 INFO L87 Difference]: Start difference. First operand 1275 states and 1709 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:39:09,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:39:09,728 INFO L93 Difference]: Finished difference Result 1308 states and 1674 transitions. [2024-12-02 08:39:09,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 08:39:09,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-12-02 08:39:09,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:39:09,730 INFO L225 Difference]: With dead ends: 1308 [2024-12-02 08:39:09,730 INFO L226 Difference]: Without dead ends: 1308 [2024-12-02 08:39:09,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-12-02 08:39:09,731 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 211 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-12-02 08:39:09,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1529 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-12-02 08:39:09,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2024-12-02 08:39:09,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1256. [2024-12-02 08:39:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 932 states have (on average 1.7778969957081545) internal successors, (1657), 1249 states have internal predecessors, (1657), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:39:09,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1667 transitions. [2024-12-02 08:39:09,755 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1667 transitions. Word has length 14 [2024-12-02 08:39:09,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:39:09,755 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 1667 transitions. [2024-12-02 08:39:09,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 08:39:09,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1667 transitions. [2024-12-02 08:39:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-02 08:39:09,755 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:39:09,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 08:39:09,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 08:39:09,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:39:09,956 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:39:09,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:39:09,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1909716041, now seen corresponding path program 1 times [2024-12-02 08:39:09,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 08:39:09,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1575444455] [2024-12-02 08:39:09,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:39:09,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:39:09,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:39:09,959 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:39:09,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 08:39:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:39:10,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 08:39:10,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:39:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:39:10,075 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 08:39:10,075 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 08:39:10,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575444455] [2024-12-02 08:39:10,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575444455] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:39:10,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:39:10,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 08:39:10,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021393424] [2024-12-02 08:39:10,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:39:10,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:39:10,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 08:39:10,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:39:10,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:39:10,076 INFO L87 Difference]: Start difference. First operand 1256 states and 1667 transitions. Second operand has 4 states, 4 states have (on average 4.0) 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-12-02 08:39:10,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 08:39:10,144 INFO L93 Difference]: Finished difference Result 1178 states and 1546 transitions. [2024-12-02 08:39:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 08:39:10,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) 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-12-02 08:39:10,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 08:39:10,146 INFO L225 Difference]: With dead ends: 1178 [2024-12-02 08:39:10,147 INFO L226 Difference]: Without dead ends: 1178 [2024-12-02 08:39:10,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 08:39:10,147 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 45 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2140 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 08:39:10,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2140 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 08:39:10,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2024-12-02 08:39:10,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1178. [2024-12-02 08:39:10,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 873 states have (on average 1.7594501718213058) internal successors, (1536), 1171 states have internal predecessors, (1536), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-12-02 08:39:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1546 transitions. [2024-12-02 08:39:10,164 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1546 transitions. Word has length 16 [2024-12-02 08:39:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 08:39:10,164 INFO L471 AbstractCegarLoop]: Abstraction has 1178 states and 1546 transitions. [2024-12-02 08:39:10,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) 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-12-02 08:39:10,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1546 transitions. [2024-12-02 08:39:10,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-02 08:39:10,165 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 08:39:10,165 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] [2024-12-02 08:39:10,174 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 08:39:10,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:39:10,365 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-12-02 08:39:10,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 08:39:10,366 INFO L85 PathProgramCache]: Analyzing trace with hash 2113969666, now seen corresponding path program 1 times [2024-12-02 08:39:10,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 08:39:10,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1353987172] [2024-12-02 08:39:10,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 08:39:10,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 08:39:10,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 08:39:10,367 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 08:39:10,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9d292c-78aa-43f6-96b3-5af130a3d322/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 08:39:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 08:39:10,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 08:39:10,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 08:39:10,480 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-12-02 08:39:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 08:39:10,550 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 08:39:10,550 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 08:39:10,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353987172] [2024-12-02 08:39:10,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353987172] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 08:39:10,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 08:39:10,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 08:39:10,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884589582] [2024-12-02 08:39:10,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 08:39:10,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 08:39:10,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 08:39:10,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 08:39:10,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 08:39:10,551 INFO L87 Difference]: Start difference. First operand 1178 states and 1546 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)