./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:12:57,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:12:57,894 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 03:12:57,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:12:57,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:12:57,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:12:57,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:12:57,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:12:57,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:12:57,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:12:57,947 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:12:57,947 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:12:57,947 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:12:57,947 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:12:57,947 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:12:57,949 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:12:57,949 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:12:57,949 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:12:57,949 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:12:57,949 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:12:57,949 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:12:57,949 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:12:57,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:12:57,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:12:57,950 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:12:57,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:12:57,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:12:57,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:12:57,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:12:57,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:12:57,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:12:57,951 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:12:57,951 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:12:57,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:12:57,952 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:12:57,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:12:57,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:12:57,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:12:57,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:12:57,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:12:57,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:12:57,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:12:57,953 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:12:57,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:12:57,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:12:57,953 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:12:57,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:12:57,953 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2024-11-14 03:12:58,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:12:58,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:12:58,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:12:58,256 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:12:58,256 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:12:58,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i Unable to find full path for "g++" [2024-11-14 03:13:00,134 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:13:00,430 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:13:00,431 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2024-11-14 03:13:00,444 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/data/a0f41f944/b880a3f923a745b18fae6efad88883c6/FLAG118822657 [2024-11-14 03:13:00,457 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/data/a0f41f944/b880a3f923a745b18fae6efad88883c6 [2024-11-14 03:13:00,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:13:00,462 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:13:00,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:13:00,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:13:00,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:13:00,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:13:00" (1/1) ... [2024-11-14 03:13:00,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4f37ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:00, skipping insertion in model container [2024-11-14 03:13:00,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:13:00" (1/1) ... [2024-11-14 03:13:00,521 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:13:00,836 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22569,22582] [2024-11-14 03:13:00,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22645,22658] [2024-11-14 03:13:00,845 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22715,22728] [2024-11-14 03:13:00,846 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22822,22835] [2024-11-14 03:13:00,847 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22894,22907] [2024-11-14 03:13:00,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23045,23058] [2024-11-14 03:13:00,851 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23119,23132] [2024-11-14 03:13:00,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:13:00,867 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:13:00,918 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22569,22582] [2024-11-14 03:13:00,919 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22645,22658] [2024-11-14 03:13:00,920 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22715,22728] [2024-11-14 03:13:00,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22822,22835] [2024-11-14 03:13:00,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22894,22907] [2024-11-14 03:13:00,924 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23045,23058] [2024-11-14 03:13:00,925 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23119,23132] [2024-11-14 03:13:00,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:13:00,967 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:13:00,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:00 WrapperNode [2024-11-14 03:13:00,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:13:00,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:13:00,970 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:13:00,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:13:00,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:00" (1/1) ... [2024-11-14 03:13:00,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:00" (1/1) ... [2024-11-14 03:13:01,020 INFO L138 Inliner]: procedures = 119, calls = 39, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 141 [2024-11-14 03:13:01,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:13:01,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:13:01,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:13:01,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:13:01,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:00" (1/1) ... [2024-11-14 03:13:01,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:00" (1/1) ... [2024-11-14 03:13:01,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:00" (1/1) ... [2024-11-14 03:13:01,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:00" (1/1) ... [2024-11-14 03:13:01,054 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:00" (1/1) ... [2024-11-14 03:13:01,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:00" (1/1) ... [2024-11-14 03:13:01,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:00" (1/1) ... [2024-11-14 03:13:01,064 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:00" (1/1) ... [2024-11-14 03:13:01,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:13:01,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:13:01,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:13:01,071 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:13:01,071 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:00" (1/1) ... [2024-11-14 03:13:01,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:13:01,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:13:01,102 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:13:01,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:13:01,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:13:01,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:13:01,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:13:01,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:13:01,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:13:01,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:13:01,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:13:01,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:13:01,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:13:01,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:13:01,233 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:13:01,235 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:13:01,490 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-14 03:13:01,491 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:13:01,617 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:13:01,618 INFO L316 CfgBuilder]: Removed 17 assume(true) statements. [2024-11-14 03:13:01,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:13:01 BoogieIcfgContainer [2024-11-14 03:13:01,618 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:13:01,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:13:01,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:13:01,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:13:01,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:13:00" (1/3) ... [2024-11-14 03:13:01,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f21d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:13:01, skipping insertion in model container [2024-11-14 03:13:01,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:13:00" (2/3) ... [2024-11-14 03:13:01,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f21d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:13:01, skipping insertion in model container [2024-11-14 03:13:01,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:13:01" (3/3) ... [2024-11-14 03:13:01,630 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2024-11-14 03:13:01,649 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:13:01,651 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-rb-cnstr_1-1.i that has 1 procedures, 41 locations, 1 initial locations, 10 loop locations, and 7 error locations. [2024-11-14 03:13:01,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:13:01,732 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5ae7b324, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:13:01,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-14 03:13:01,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 33 states have (on average 2.0) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 03:13:01,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:01,746 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 03:13:01,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-14 03:13:01,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:01,754 INFO L85 PathProgramCache]: Analyzing trace with hash 202622684, now seen corresponding path program 1 times [2024-11-14 03:13:01,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:01,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427388189] [2024-11-14 03:13:01,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:01,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:13:01,958 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:01,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427388189] [2024-11-14 03:13:01,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427388189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:13:01,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:13:01,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:13:01,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623723791] [2024-11-14 03:13:01,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:13:01,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 03:13:01,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:01,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 03:13:01,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 03:13:01,983 INFO L87 Difference]: Start difference. First operand has 41 states, 33 states have (on average 2.0) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:02,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:02,125 INFO L93 Difference]: Finished difference Result 81 states and 131 transitions. [2024-11-14 03:13:02,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:13:02,128 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-11-14 03:13:02,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:02,133 INFO L225 Difference]: With dead ends: 81 [2024-11-14 03:13:02,133 INFO L226 Difference]: Without dead ends: 39 [2024-11-14 03:13:02,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 03:13:02,138 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:02,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:13:02,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-14 03:13:02,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-14 03:13:02,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.28125) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:02,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2024-11-14 03:13:02,181 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 5 [2024-11-14 03:13:02,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:02,181 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-11-14 03:13:02,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2024-11-14 03:13:02,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:13:02,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:02,182 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:13:02,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:13:02,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-14 03:13:02,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:02,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1923441391, now seen corresponding path program 1 times [2024-11-14 03:13:02,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:02,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614715613] [2024-11-14 03:13:02,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:02,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:02,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:13:02,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:02,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614715613] [2024-11-14 03:13:02,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614715613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:13:02,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:13:02,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:13:02,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352500849] [2024-11-14 03:13:02,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:13:02,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:13:02,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:02,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:13:02,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:13:02,398 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:02,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:02,585 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2024-11-14 03:13:02,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:13:02,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 03:13:02,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:02,591 INFO L225 Difference]: With dead ends: 42 [2024-11-14 03:13:02,591 INFO L226 Difference]: Without dead ends: 38 [2024-11-14 03:13:02,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:13:02,592 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 61 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:02,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 33 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:13:02,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-14 03:13:02,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-11-14 03:13:02,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:02,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2024-11-14 03:13:02,603 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 6 [2024-11-14 03:13:02,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:02,603 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2024-11-14 03:13:02,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:02,603 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2024-11-14 03:13:02,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:13:02,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:02,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:13:02,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:13:02,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-14 03:13:02,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:02,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1928720262, now seen corresponding path program 1 times [2024-11-14 03:13:02,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:02,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306596557] [2024-11-14 03:13:02,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:02,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:03,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:13:03,820 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:03,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306596557] [2024-11-14 03:13:03,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306596557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:13:03,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:13:03,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:13:03,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117216357] [2024-11-14 03:13:03,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:13:03,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:13:03,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:03,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:13:03,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:13:03,825 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:04,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:04,109 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2024-11-14 03:13:04,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:13:04,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 03:13:04,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:04,110 INFO L225 Difference]: With dead ends: 35 [2024-11-14 03:13:04,110 INFO L226 Difference]: Without dead ends: 33 [2024-11-14 03:13:04,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:13:04,111 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:04,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 82 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:13:04,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-14 03:13:04,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-14 03:13:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 32 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-11-14 03:13:04,119 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 6 [2024-11-14 03:13:04,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:04,120 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-11-14 03:13:04,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-11-14 03:13:04,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 03:13:04,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:04,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:04,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:13:04,121 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-14 03:13:04,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:04,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2087780398, now seen corresponding path program 1 times [2024-11-14 03:13:04,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:04,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112466605] [2024-11-14 03:13:04,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:04,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:13:04,234 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:04,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112466605] [2024-11-14 03:13:04,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112466605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:13:04,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:13:04,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:13:04,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46674965] [2024-11-14 03:13:04,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:13:04,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:13:04,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:04,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:13:04,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:13:04,236 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 5 states, 5 states have (on average 1.8) 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-11-14 03:13:04,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:04,708 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-11-14 03:13:04,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:13:04,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) 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-11-14 03:13:04,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:04,710 INFO L225 Difference]: With dead ends: 58 [2024-11-14 03:13:04,712 INFO L226 Difference]: Without dead ends: 56 [2024-11-14 03:13:04,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:13:04,713 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:04,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 81 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:13:04,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-14 03:13:04,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2024-11-14 03:13:04,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:04,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2024-11-14 03:13:04,729 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 9 [2024-11-14 03:13:04,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:04,729 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-11-14 03:13:04,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) 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-11-14 03:13:04,730 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2024-11-14 03:13:04,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 03:13:04,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:04,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:04,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:13:04,731 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-14 03:13:04,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:04,732 INFO L85 PathProgramCache]: Analyzing trace with hash 436779806, now seen corresponding path program 1 times [2024-11-14 03:13:04,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:04,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171060524] [2024-11-14 03:13:04,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:04,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:05,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:13:05,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:05,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171060524] [2024-11-14 03:13:05,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171060524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:13:05,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:13:05,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:13:05,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979442349] [2024-11-14 03:13:05,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:13:05,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:13:05,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:05,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:13:05,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:13:05,396 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 4 states, 4 states have (on average 2.25) 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-11-14 03:13:05,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:05,958 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2024-11-14 03:13:05,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:13:05,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) 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-11-14 03:13:05,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:05,959 INFO L225 Difference]: With dead ends: 40 [2024-11-14 03:13:05,959 INFO L226 Difference]: Without dead ends: 38 [2024-11-14 03:13:05,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:13:05,960 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:05,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 66 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:13:05,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-14 03:13:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-14 03:13:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2024-11-14 03:13:05,968 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 9 [2024-11-14 03:13:05,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:05,969 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2024-11-14 03:13:05,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) 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-11-14 03:13:05,969 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-11-14 03:13:05,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 03:13:05,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:05,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:05,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:13:05,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-14 03:13:05,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:05,970 INFO L85 PathProgramCache]: Analyzing trace with hash -437894699, now seen corresponding path program 1 times [2024-11-14 03:13:05,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:05,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418692589] [2024-11-14 03:13:05,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:05,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:13:06,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:06,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418692589] [2024-11-14 03:13:06,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418692589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:13:06,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:13:06,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:13:06,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845392116] [2024-11-14 03:13:06,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:13:06,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:13:06,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:06,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:13:06,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:13:06,027 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:06,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:06,365 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2024-11-14 03:13:06,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:13:06,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-11-14 03:13:06,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:06,366 INFO L225 Difference]: With dead ends: 53 [2024-11-14 03:13:06,366 INFO L226 Difference]: Without dead ends: 41 [2024-11-14 03:13:06,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:13:06,367 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:06,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 70 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:13:06,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-14 03:13:06,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-14 03:13:06,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:06,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2024-11-14 03:13:06,387 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2024-11-14 03:13:06,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:06,388 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-11-14 03:13:06,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:06,388 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2024-11-14 03:13:06,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 03:13:06,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:06,388 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:06,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 03:13:06,389 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-14 03:13:06,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:06,389 INFO L85 PathProgramCache]: Analyzing trace with hash -386171062, now seen corresponding path program 1 times [2024-11-14 03:13:06,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:06,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661681021] [2024-11-14 03:13:06,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:06,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:06,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:13:06,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:06,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661681021] [2024-11-14 03:13:06,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661681021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:13:06,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662473669] [2024-11-14 03:13:06,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:06,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:06,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:13:06,548 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:13:06,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:13:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:06,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 03:13:06,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:13:06,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:13:06,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-14 03:13:06,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:13:06,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:13:07,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:13:07,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662473669] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:13:07,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [176123284] [2024-11-14 03:13:07,077 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-14 03:13:07,077 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:13:07,080 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:13:07,084 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:13:07,085 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:13:07,949 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:13:09,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [176123284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:13:09,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:13:09,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4, 4] total 11 [2024-11-14 03:13:09,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864019293] [2024-11-14 03:13:09,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:13:09,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:13:09,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:09,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:13:09,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:13:09,505 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:12,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:13:12,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:12,480 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-11-14 03:13:12,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:13:12,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-14 03:13:12,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:12,481 INFO L225 Difference]: With dead ends: 58 [2024-11-14 03:13:12,481 INFO L226 Difference]: Without dead ends: 35 [2024-11-14 03:13:12,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:13:12,482 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:12,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2024-11-14 03:13:12,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-14 03:13:12,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-14 03:13:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:12,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2024-11-14 03:13:12,492 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 16 [2024-11-14 03:13:12,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:12,492 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2024-11-14 03:13:12,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:13:12,493 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2024-11-14 03:13:12,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 03:13:12,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:12,494 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:13:12,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:13:12,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:12,695 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-14 03:13:12,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:12,697 INFO L85 PathProgramCache]: Analyzing trace with hash 340546170, now seen corresponding path program 1 times [2024-11-14 03:13:12,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:13:12,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076255551] [2024-11-14 03:13:12,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:12,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:13:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:13:14,023 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:13:14,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076255551] [2024-11-14 03:13:14,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076255551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:13:14,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966604837] [2024-11-14 03:13:14,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:14,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:13:14,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:13:14,026 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:13:14,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 03:13:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:14,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 03:13:14,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:13:14,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:13:14,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:13:14,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 526 treesize of output 398 [2024-11-14 03:13:14,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:14,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:14,503 INFO L349 Elim1Store]: treesize reduction 186, result has 5.6 percent of original size [2024-11-14 03:13:14,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 454 treesize of output 497 [2024-11-14 03:13:14,673 INFO L349 Elim1Store]: treesize reduction 139, result has 16.8 percent of original size [2024-11-14 03:13:14,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 711 treesize of output 760 [2024-11-14 03:13:14,943 INFO L349 Elim1Store]: treesize reduction 109, result has 33.9 percent of original size [2024-11-14 03:13:14,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 610 treesize of output 673 [2024-11-14 03:13:15,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:13:15,013 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 273 treesize of output 267 [2024-11-14 03:13:15,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 285 [2024-11-14 03:13:15,173 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2024-11-14 03:13:15,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 271 [2024-11-14 03:13:15,269 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:13:15,314 INFO L349 Elim1Store]: treesize reduction 73, result has 16.1 percent of original size [2024-11-14 03:13:15,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 108 treesize of output 112 [2024-11-14 03:13:15,712 INFO L349 Elim1Store]: treesize reduction 216, result has 0.5 percent of original size [2024-11-14 03:13:15,713 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 2 case distinctions, treesize of input 99 treesize of output 1 [2024-11-14 03:13:15,759 INFO L349 Elim1Store]: treesize reduction 170, result has 2.9 percent of original size [2024-11-14 03:13:15,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 289 treesize of output 239 [2024-11-14 03:13:15,835 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: unsuccessful DER [2024-11-14 03:13:15,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1185095119] [2024-11-14 03:13:15,838 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:13:15,839 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:13:15,839 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:13:15,839 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:13:15,840 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:13:32,774 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:13:35,045 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (let ((.cse12 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse12)) (.cse13 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) .cse12))) (or (and (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_31| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_52| (Array Int (Array Int Int))) (|v_#valid_34| (Array Int Int)) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_int_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~end~0#1.base_66| Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_13| Int) (|v_#memory_int_46| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem9#1.base_21| Int) (|v_#memory_int_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~end~0#1.offset_66| Int) (|v_ULTIMATE.start_main_#t~mem8#1.base_21| Int) (|v_#memory_$Pointer$.offset_31| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_52| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_32| Int) (|v_#length_24| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem9#1.offset_21| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_16| Int) (|v_ULTIMATE.start_main_#t~nondet6#1_15| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.offset_21| Int) (|v_#memory_int_50| (Array Int (Array Int Int)))) (let ((.cse9 (let ((.cse22 (store |v_#memory_$Pointer$.base_52| |v_ULTIMATE.start_main_~end~0#1.base_66| (store (select |v_#memory_$Pointer$.base_52| |v_ULTIMATE.start_main_~end~0#1.base_66|) |v_ULTIMATE.start_main_~end~0#1.offset_66| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|)))) (store .cse22 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse22 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 |v_ULTIMATE.start_main_~end~0#1.base_66|))))) (let ((.cse6 (let ((.cse21 (store |v_#memory_$Pointer$.offset_52| |v_ULTIMATE.start_main_~end~0#1.base_66| (store (select |v_#memory_$Pointer$.offset_52| |v_ULTIMATE.start_main_~end~0#1.base_66|) |v_ULTIMATE.start_main_~end~0#1.offset_66| 0)))) (store .cse21 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse21 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 |v_ULTIMATE.start_main_~end~0#1.offset_66|)))) (.cse1 (select (select .cse9 |v_ULTIMATE.start_main_~end~0#1.base_66|) |v_ULTIMATE.start_main_~end~0#1.offset_66|))) (let ((.cse4 (select |v_#memory_int_45| .cse1)) (.cse3 (select (select .cse6 |v_ULTIMATE.start_main_~end~0#1.base_66|) |v_ULTIMATE.start_main_~end~0#1.offset_66|))) (and (= (select |v_#valid_34| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 0) (= |v_#memory_int_51| (store |v_#memory_int_125| |v_ULTIMATE.start_main_~end~0#1.base_66| (store (select |v_#memory_int_125| |v_ULTIMATE.start_main_~end~0#1.base_66|) |v_ULTIMATE.start_main_~end~0#1.offset_66| (select (select |v_#memory_int_51| |v_ULTIMATE.start_main_~end~0#1.base_66|) |v_ULTIMATE.start_main_~end~0#1.offset_66|)))) (<= |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483647) (let ((.cse10 (store (select .cse9 .cse1) .cse3 0)) (.cse8 (store |v_#length_24| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 12)) (.cse0 (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0)) (.cse2 (store |v_#valid_34| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1)) (.cse7 (store (select .cse6 .cse1) .cse3 0)) (.cse5 (+ 8 .cse3))) (or (and (not .cse0) (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_21| |c_ULTIMATE.start_main_#t~malloc7#1.offset|) (= |c_ULTIMATE.start_main_#t~mem9#1.offset| |v_ULTIMATE.start_main_#t~mem9#1.offset_21|) (= |c_ULTIMATE.start_main_#t~mem8#1.offset| |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_32| |c_ULTIMATE.start_main_#t~malloc7#1.base|) (= |c_ULTIMATE.start_main_#t~mem9#1.base| |v_ULTIMATE.start_main_#t~mem9#1.base_21|) (= .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_#valid| .cse2) (= |c_ULTIMATE.start_main_~end~0#1.offset| .cse3) (= (store |v_#memory_int_45| .cse1 (store .cse4 .cse5 1)) |c_#memory_int|) (= |c_#memory_$Pointer$.offset| (store .cse6 .cse1 (store .cse7 .cse5 (select (select |c_#memory_$Pointer$.offset| .cse1) .cse5)))) (= |v_ULTIMATE.start_main_#t~mem8#1.base_21| |c_ULTIMATE.start_main_#t~mem8#1.base|) (= |c_#length| .cse8) (= |c_#memory_$Pointer$.base| (store .cse9 .cse1 (store .cse10 .cse5 (select (select |c_#memory_$Pointer$.base| .cse1) .cse5))))) (let ((.cse15 (select |v_#memory_$Pointer$.base_31| .cse1)) (.cse18 (select |v_#memory_$Pointer$.offset_31| .cse1))) (let ((.cse11 (let ((.cse20 (store |v_#memory_$Pointer$.offset_31| .cse1 (store .cse18 .cse3 0)))) (store .cse20 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse20 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse3)))) (.cse14 (select |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse16 (let ((.cse19 (store |v_#memory_$Pointer$.base_31| .cse1 (store .cse15 .cse3 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|)))) (store .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse1))))) (and (= (store |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 (select (select |v_#memory_int_46| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4))) |v_#memory_int_46|) (= (store |v_#memory_int_45| .cse1 (store (store .cse4 .cse5 0) .cse3 (select (select |v_#memory_int_47| .cse1) .cse3))) |v_#memory_int_47|) (= (store .cse11 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse11 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse12 .cse13)) |c_#memory_$Pointer$.offset|) (= |v_#memory_int_48| (store |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (select .cse14 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (store .cse9 .cse1 (store .cse10 .cse5 (select .cse15 .cse5))) |v_#memory_$Pointer$.base_31|) (= (store .cse8 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 12) |c_#length|) .cse0 (= |c_ULTIMATE.start_main_~end~0#1.offset| (select (select .cse11 .cse1) .cse3)) (= |c_#valid| (store .cse2 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1)) (<= (+ |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store .cse16 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse16 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse12 .cse17))) (= (select .cse2 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 0) (= (store |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse14 .cse12 1)) |c_#memory_int|) (= (store .cse6 .cse1 (store .cse7 .cse5 (select .cse18 .cse5))) |v_#memory_$Pointer$.offset_31|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 0)) (= |c_ULTIMATE.start_main_~end~0#1.base| (select (select .cse16 .cse1) .cse3))))))) (= |v_#memory_int_50| (store |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 (select (select |v_#memory_int_50| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4)))) (<= (+ |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1) |c_#StackHeapBarrier|) (= |v_#memory_int_45| (store |v_#memory_int_50| .cse1 (store (select |v_#memory_int_50| .cse1) .cse3 (select .cse4 .cse3)))) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 0)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483648))))))) (exists ((|v_ULTIMATE.start_main_#t~nondet2#1_26| Int)) (and (<= |v_ULTIMATE.start_main_#t~nondet2#1_26| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet2#1_26| 2147483648)) (not (= |v_ULTIMATE.start_main_#t~nondet2#1_26| 0))))) (and (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_32| (Array Int (Array Int Int))) (|v_#memory_int_33| (Array Int (Array Int Int))) (|v_#memory_int_115| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_13| Int) (|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_47| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem9#1.base_18| Int) (|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_47| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int) (|v_ULTIMATE.start_main_#t~nondet6#1_15| Int) (|v_ULTIMATE.start_main_#t~mem9#1.offset_18| Int) (|v_#memory_int_50| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_31| (Array Int (Array Int Int))) (|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#valid_30| (Array Int Int)) (|v_#memory_int_46| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_48| (Array Int (Array Int Int))) (|v_#length_20| (Array Int Int)) (|v_#memory_$Pointer$.offset_31| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem8#1.base_18| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.offset_18| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_28| Int)) (let ((.cse25 (select |v_#memory_$Pointer$.base_48| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse29 (let ((.cse48 (store |v_#memory_$Pointer$.base_48| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse25 0 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|)))) (store .cse48 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse48 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 |c_ULTIMATE.start_main_~list~0#1.base|)))) (.cse24 (select |v_#memory_$Pointer$.offset_48| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse34 (let ((.cse47 (store |v_#memory_$Pointer$.offset_48| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse24 0 0)))) (store .cse47 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse47 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 0)))) (.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~list~0#1.base|) 0))) (let ((.cse23 (select |v_#memory_int_32| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse45 (store |v_#valid_30| |c_ULTIMATE.start_main_~list~0#1.base| 1)) (.cse46 (select |v_#memory_int_33| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse37 (select |v_#memory_int_45| .cse30)) (.cse28 (select (select .cse34 |c_ULTIMATE.start_main_~list~0#1.base|) 0)) (.cse26 (select |v_#memory_int_115| 1))) (and (= |v_#memory_int_51| (store |v_#memory_int_32| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse23 8 1) 0 (select (select |v_#memory_int_51| |c_ULTIMATE.start_main_~list~0#1.base|) 0)))) (= (store |v_#memory_$Pointer$.offset_47| |c_ULTIMATE.start_main_~list~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_47| |c_ULTIMATE.start_main_~list~0#1.base|) 0 0) 4 0) 8 (select .cse24 8))) |v_#memory_$Pointer$.offset_48|) (= (select |v_#valid_30| 2) 1) (= (store |v_#memory_$Pointer$.base_47| |c_ULTIMATE.start_main_~list~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_47| |c_ULTIMATE.start_main_~list~0#1.base|) 0 0) 4 0) 8 (select .cse25 8))) |v_#memory_$Pointer$.base_48|) (<= |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483647) (= (select .cse26 1) 0) (= (select |v_#valid_30| |c_ULTIMATE.start_main_~list~0#1.base|) 0) (= (select |v_#valid_30| 0) 0) (= |v_#memory_int_50| (store |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 (select (select |v_#memory_int_50| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4)))) (= 19 (select |v_#length_20| 2)) (let ((.cse27 (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0)) (.cse35 (store (select .cse34 .cse30) .cse28 0)) (.cse36 (store (store |v_#length_20| |c_ULTIMATE.start_main_~list~0#1.base| 12) |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 12)) (.cse31 (store (select .cse29 .cse30) .cse28 0)) (.cse32 (+ .cse28 8)) (.cse33 (store .cse45 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1))) (or (and (not .cse27) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_28| |c_ULTIMATE.start_main_#t~malloc7#1.base|) (= |c_ULTIMATE.start_main_#t~mem9#1.base| |v_ULTIMATE.start_main_#t~mem9#1.base_18|) (= |c_ULTIMATE.start_main_~end~0#1.offset| .cse28) (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_18| |c_ULTIMATE.start_main_#t~malloc7#1.offset|) (= (store .cse29 .cse30 (store .cse31 .cse32 (select (select |c_#memory_$Pointer$.base| .cse30) .cse32))) |c_#memory_$Pointer$.base|) (= |v_ULTIMATE.start_main_#t~mem8#1.base_18| |c_ULTIMATE.start_main_#t~mem8#1.base|) (= |c_#valid| .cse33) (= |c_ULTIMATE.start_main_~end~0#1.base| .cse30) (= |c_#memory_$Pointer$.offset| (store .cse34 .cse30 (store .cse35 .cse32 (select (select |c_#memory_$Pointer$.offset| .cse30) .cse32)))) (= .cse36 |c_#length|) (= |c_ULTIMATE.start_main_#t~mem9#1.offset| |v_ULTIMATE.start_main_#t~mem9#1.offset_18|) (= |c_ULTIMATE.start_main_#t~mem8#1.offset| |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) (= (store |v_#memory_int_45| .cse30 (store .cse37 .cse32 1)) |c_#memory_int|)) (let ((.cse41 (select |v_#memory_$Pointer$.base_31| .cse30)) (.cse39 (select |v_#memory_$Pointer$.offset_31| .cse30))) (let ((.cse42 (let ((.cse44 (store |v_#memory_$Pointer$.offset_31| .cse30 (store .cse39 .cse28 0)))) (store .cse44 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse44 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse28)))) (.cse40 (let ((.cse43 (store |v_#memory_$Pointer$.base_31| .cse30 (store .cse41 .cse28 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|)))) (store .cse43 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse43 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse30)))) (.cse38 (select |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (= (store |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 (select (select |v_#memory_int_46| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4))) |v_#memory_int_46|) (= |v_#memory_int_48| (store |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (select .cse38 |c_ULTIMATE.start_main_~end~0#1.offset|)))) .cse27 (= (store |v_#memory_int_45| .cse30 (store (store .cse37 .cse32 0) .cse28 (select (select |v_#memory_int_47| .cse30) .cse28))) |v_#memory_int_47|) (= (store .cse34 .cse30 (store .cse35 .cse32 (select .cse39 .cse32))) |v_#memory_$Pointer$.offset_31|) (= |c_#memory_$Pointer$.base| (store .cse40 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse40 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse12 .cse17))) (= (store .cse36 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 12) |c_#length|) (= |c_#valid| (store .cse33 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1)) (= (store .cse29 .cse30 (store .cse31 .cse32 (select .cse41 .cse32))) |v_#memory_$Pointer$.base_31|) (= (store .cse42 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse42 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse12 .cse13)) |c_#memory_$Pointer$.offset|) (= |c_ULTIMATE.start_main_~end~0#1.offset| (select (select .cse42 .cse30) .cse28)) (<= (+ |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1) |c_#StackHeapBarrier|) (= (select .cse33 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 0) (= (select (select .cse40 .cse30) .cse28) |c_ULTIMATE.start_main_~end~0#1.base|) (= (store |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse38 .cse12 1)) |c_#memory_int|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 0))))))) (<= (+ |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1) |c_#StackHeapBarrier|) (= (select |v_#valid_30| 1) 1) (= |v_#memory_int_32| (store |v_#memory_int_33| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse46 4 (select .cse23 4)))) (= 0 (select .cse45 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|)) (= 2 (select |v_#length_20| 1)) (= |v_#memory_int_33| (store |v_#memory_int_115| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |v_#memory_int_115| |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse46 0)))) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 0)) (= |v_#memory_int_45| (store |v_#memory_int_50| .cse30 (store (select |v_#memory_int_50| .cse30) .cse28 (select .cse37 .cse28)))) (= (select .cse26 0) 48) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483648)))))))) (exists ((|v_ULTIMATE.start_main_#t~nondet2#1_22| Int)) (and (<= |v_ULTIMATE.start_main_#t~nondet2#1_22| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet2#1_22| 2147483648)) (not (= |v_ULTIMATE.start_main_#t~nondet2#1_22| 0)))) (<= (+ |c_ULTIMATE.start_main_~list~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0)))))) (<= 1 |c_#StackHeapBarrier|)) is different from false [2024-11-14 03:14:30,295 WARN L286 SmtUtils]: Spent 41.62s on a formula simplification that was a NOOP. DAG size: 404 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:14:32,318 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8))) (and (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse12)) (.cse13 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) .cse12))) (or (and (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_31| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_52| (Array Int (Array Int Int))) (|v_#valid_34| (Array Int Int)) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_int_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~end~0#1.base_66| Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_13| Int) (|v_#memory_int_46| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem9#1.base_21| Int) (|v_#memory_int_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~end~0#1.offset_66| Int) (|v_ULTIMATE.start_main_#t~mem8#1.base_21| Int) (|v_#memory_$Pointer$.offset_31| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_52| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_32| Int) (|v_#length_24| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem9#1.offset_21| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_16| Int) (|v_ULTIMATE.start_main_#t~nondet6#1_15| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.offset_21| Int) (|v_#memory_int_50| (Array Int (Array Int Int)))) (let ((.cse9 (let ((.cse22 (store |v_#memory_$Pointer$.base_52| |v_ULTIMATE.start_main_~end~0#1.base_66| (store (select |v_#memory_$Pointer$.base_52| |v_ULTIMATE.start_main_~end~0#1.base_66|) |v_ULTIMATE.start_main_~end~0#1.offset_66| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|)))) (store .cse22 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse22 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 |v_ULTIMATE.start_main_~end~0#1.base_66|))))) (let ((.cse6 (let ((.cse21 (store |v_#memory_$Pointer$.offset_52| |v_ULTIMATE.start_main_~end~0#1.base_66| (store (select |v_#memory_$Pointer$.offset_52| |v_ULTIMATE.start_main_~end~0#1.base_66|) |v_ULTIMATE.start_main_~end~0#1.offset_66| 0)))) (store .cse21 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse21 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 |v_ULTIMATE.start_main_~end~0#1.offset_66|)))) (.cse1 (select (select .cse9 |v_ULTIMATE.start_main_~end~0#1.base_66|) |v_ULTIMATE.start_main_~end~0#1.offset_66|))) (let ((.cse4 (select |v_#memory_int_45| .cse1)) (.cse3 (select (select .cse6 |v_ULTIMATE.start_main_~end~0#1.base_66|) |v_ULTIMATE.start_main_~end~0#1.offset_66|))) (and (= (select |v_#valid_34| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 0) (= |v_#memory_int_51| (store |v_#memory_int_125| |v_ULTIMATE.start_main_~end~0#1.base_66| (store (select |v_#memory_int_125| |v_ULTIMATE.start_main_~end~0#1.base_66|) |v_ULTIMATE.start_main_~end~0#1.offset_66| (select (select |v_#memory_int_51| |v_ULTIMATE.start_main_~end~0#1.base_66|) |v_ULTIMATE.start_main_~end~0#1.offset_66|)))) (<= |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483647) (let ((.cse10 (store (select .cse9 .cse1) .cse3 0)) (.cse8 (store |v_#length_24| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 12)) (.cse0 (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0)) (.cse2 (store |v_#valid_34| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1)) (.cse7 (store (select .cse6 .cse1) .cse3 0)) (.cse5 (+ 8 .cse3))) (or (and (not .cse0) (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_21| |c_ULTIMATE.start_main_#t~malloc7#1.offset|) (= |c_ULTIMATE.start_main_#t~mem9#1.offset| |v_ULTIMATE.start_main_#t~mem9#1.offset_21|) (= |c_ULTIMATE.start_main_#t~mem8#1.offset| |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_32| |c_ULTIMATE.start_main_#t~malloc7#1.base|) (= |c_ULTIMATE.start_main_#t~mem9#1.base| |v_ULTIMATE.start_main_#t~mem9#1.base_21|) (= .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_#valid| .cse2) (= |c_ULTIMATE.start_main_~end~0#1.offset| .cse3) (= (store |v_#memory_int_45| .cse1 (store .cse4 .cse5 1)) |c_#memory_int|) (= |c_#memory_$Pointer$.offset| (store .cse6 .cse1 (store .cse7 .cse5 (select (select |c_#memory_$Pointer$.offset| .cse1) .cse5)))) (= |v_ULTIMATE.start_main_#t~mem8#1.base_21| |c_ULTIMATE.start_main_#t~mem8#1.base|) (= |c_#length| .cse8) (= |c_#memory_$Pointer$.base| (store .cse9 .cse1 (store .cse10 .cse5 (select (select |c_#memory_$Pointer$.base| .cse1) .cse5))))) (let ((.cse15 (select |v_#memory_$Pointer$.base_31| .cse1)) (.cse18 (select |v_#memory_$Pointer$.offset_31| .cse1))) (let ((.cse11 (let ((.cse20 (store |v_#memory_$Pointer$.offset_31| .cse1 (store .cse18 .cse3 0)))) (store .cse20 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse20 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse3)))) (.cse14 (select |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse16 (let ((.cse19 (store |v_#memory_$Pointer$.base_31| .cse1 (store .cse15 .cse3 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|)))) (store .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse1))))) (and (= (store |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 (select (select |v_#memory_int_46| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4))) |v_#memory_int_46|) (= (store |v_#memory_int_45| .cse1 (store (store .cse4 .cse5 0) .cse3 (select (select |v_#memory_int_47| .cse1) .cse3))) |v_#memory_int_47|) (= (store .cse11 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse11 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse12 .cse13)) |c_#memory_$Pointer$.offset|) (= |v_#memory_int_48| (store |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (select .cse14 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (store .cse9 .cse1 (store .cse10 .cse5 (select .cse15 .cse5))) |v_#memory_$Pointer$.base_31|) (= (store .cse8 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 12) |c_#length|) .cse0 (= |c_ULTIMATE.start_main_~end~0#1.offset| (select (select .cse11 .cse1) .cse3)) (= |c_#valid| (store .cse2 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1)) (<= (+ |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store .cse16 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse16 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse12 .cse17))) (= (select .cse2 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 0) (= (store |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse14 .cse12 1)) |c_#memory_int|) (= (store .cse6 .cse1 (store .cse7 .cse5 (select .cse18 .cse5))) |v_#memory_$Pointer$.offset_31|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 0)) (= |c_ULTIMATE.start_main_~end~0#1.base| (select (select .cse16 .cse1) .cse3))))))) (= |v_#memory_int_50| (store |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 (select (select |v_#memory_int_50| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4)))) (<= (+ |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1) |c_#StackHeapBarrier|) (= |v_#memory_int_45| (store |v_#memory_int_50| .cse1 (store (select |v_#memory_int_50| .cse1) .cse3 (select .cse4 .cse3)))) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 0)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483648))))))) (exists ((|v_ULTIMATE.start_main_#t~nondet2#1_26| Int)) (and (<= |v_ULTIMATE.start_main_#t~nondet2#1_26| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet2#1_26| 2147483648)) (not (= |v_ULTIMATE.start_main_#t~nondet2#1_26| 0))))) (and (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_32| (Array Int (Array Int Int))) (|v_#memory_int_33| (Array Int (Array Int Int))) (|v_#memory_int_115| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_13| Int) (|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_47| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem9#1.base_18| Int) (|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_47| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int) (|v_ULTIMATE.start_main_#t~nondet6#1_15| Int) (|v_ULTIMATE.start_main_#t~mem9#1.offset_18| Int) (|v_#memory_int_50| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_31| (Array Int (Array Int Int))) (|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#valid_30| (Array Int Int)) (|v_#memory_int_46| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_48| (Array Int (Array Int Int))) (|v_#length_20| (Array Int Int)) (|v_#memory_$Pointer$.offset_31| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem8#1.base_18| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.offset_18| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_28| Int)) (let ((.cse25 (select |v_#memory_$Pointer$.base_48| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse29 (let ((.cse48 (store |v_#memory_$Pointer$.base_48| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse25 0 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|)))) (store .cse48 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse48 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 |c_ULTIMATE.start_main_~list~0#1.base|)))) (.cse24 (select |v_#memory_$Pointer$.offset_48| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse34 (let ((.cse47 (store |v_#memory_$Pointer$.offset_48| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse24 0 0)))) (store .cse47 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select .cse47 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 0)))) (.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~list~0#1.base|) 0))) (let ((.cse23 (select |v_#memory_int_32| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse45 (store |v_#valid_30| |c_ULTIMATE.start_main_~list~0#1.base| 1)) (.cse46 (select |v_#memory_int_33| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse37 (select |v_#memory_int_45| .cse30)) (.cse28 (select (select .cse34 |c_ULTIMATE.start_main_~list~0#1.base|) 0)) (.cse26 (select |v_#memory_int_115| 1))) (and (= |v_#memory_int_51| (store |v_#memory_int_32| |c_ULTIMATE.start_main_~list~0#1.base| (store (store .cse23 8 1) 0 (select (select |v_#memory_int_51| |c_ULTIMATE.start_main_~list~0#1.base|) 0)))) (= (store |v_#memory_$Pointer$.offset_47| |c_ULTIMATE.start_main_~list~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_47| |c_ULTIMATE.start_main_~list~0#1.base|) 0 0) 4 0) 8 (select .cse24 8))) |v_#memory_$Pointer$.offset_48|) (= (select |v_#valid_30| 2) 1) (= (store |v_#memory_$Pointer$.base_47| |c_ULTIMATE.start_main_~list~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_47| |c_ULTIMATE.start_main_~list~0#1.base|) 0 0) 4 0) 8 (select .cse25 8))) |v_#memory_$Pointer$.base_48|) (<= |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483647) (= (select .cse26 1) 0) (= (select |v_#valid_30| |c_ULTIMATE.start_main_~list~0#1.base|) 0) (= (select |v_#valid_30| 0) 0) (= |v_#memory_int_50| (store |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4 (select (select |v_#memory_int_50| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) 4)))) (= 19 (select |v_#length_20| 2)) (let ((.cse27 (= |v_ULTIMATE.start_main_#t~nondet6#1_15| 0)) (.cse35 (store (select .cse34 .cse30) .cse28 0)) (.cse36 (store (store |v_#length_20| |c_ULTIMATE.start_main_~list~0#1.base| 12) |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 12)) (.cse31 (store (select .cse29 .cse30) .cse28 0)) (.cse32 (+ .cse28 8)) (.cse33 (store .cse45 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1))) (or (and (not .cse27) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_28| |c_ULTIMATE.start_main_#t~malloc7#1.base|) (= |c_ULTIMATE.start_main_#t~mem9#1.base| |v_ULTIMATE.start_main_#t~mem9#1.base_18|) (= |c_ULTIMATE.start_main_~end~0#1.offset| .cse28) (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_18| |c_ULTIMATE.start_main_#t~malloc7#1.offset|) (= (store .cse29 .cse30 (store .cse31 .cse32 (select (select |c_#memory_$Pointer$.base| .cse30) .cse32))) |c_#memory_$Pointer$.base|) (= |v_ULTIMATE.start_main_#t~mem8#1.base_18| |c_ULTIMATE.start_main_#t~mem8#1.base|) (= |c_#valid| .cse33) (= |c_ULTIMATE.start_main_~end~0#1.base| .cse30) (= |c_#memory_$Pointer$.offset| (store .cse34 .cse30 (store .cse35 .cse32 (select (select |c_#memory_$Pointer$.offset| .cse30) .cse32)))) (= .cse36 |c_#length|) (= |c_ULTIMATE.start_main_#t~mem9#1.offset| |v_ULTIMATE.start_main_#t~mem9#1.offset_18|) (= |c_ULTIMATE.start_main_#t~mem8#1.offset| |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) (= (store |v_#memory_int_45| .cse30 (store .cse37 .cse32 1)) |c_#memory_int|)) (let ((.cse41 (select |v_#memory_$Pointer$.base_31| .cse30)) (.cse39 (select |v_#memory_$Pointer$.offset_31| .cse30))) (let ((.cse42 (let ((.cse44 (store |v_#memory_$Pointer$.offset_31| .cse30 (store .cse39 .cse28 0)))) (store .cse44 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse44 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse28)))) (.cse40 (let ((.cse43 (store |v_#memory_$Pointer$.base_31| .cse30 (store .cse41 .cse28 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|)))) (store .cse43 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select .cse43 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 .cse30)))) (.cse38 (select |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (= (store |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16| (store (select |v_#memory_int_47| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4 (select (select |v_#memory_int_46| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 4))) |v_#memory_int_46|) (= |v_#memory_int_48| (store |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |v_#memory_int_46| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (select .cse38 |c_ULTIMATE.start_main_~end~0#1.offset|)))) .cse27 (= (store |v_#memory_int_45| .cse30 (store (store .cse37 .cse32 0) .cse28 (select (select |v_#memory_int_47| .cse30) .cse28))) |v_#memory_int_47|) (= (store .cse34 .cse30 (store .cse35 .cse32 (select .cse39 .cse32))) |v_#memory_$Pointer$.offset_31|) (= |c_#memory_$Pointer$.base| (store .cse40 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse40 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse12 .cse17))) (= (store .cse36 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 12) |c_#length|) (= |c_#valid| (store .cse33 |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1)) (= (store .cse29 .cse30 (store .cse31 .cse32 (select .cse41 .cse32))) |v_#memory_$Pointer$.base_31|) (= (store .cse42 |c_ULTIMATE.start_main_~end~0#1.base| (store (store (select .cse42 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0) .cse12 .cse13)) |c_#memory_$Pointer$.offset|) (= |c_ULTIMATE.start_main_~end~0#1.offset| (select (select .cse42 .cse30) .cse28)) (<= (+ |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 1) |c_#StackHeapBarrier|) (= (select .cse33 |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 0) (= (select (select .cse40 .cse30) .cse28) |c_ULTIMATE.start_main_~end~0#1.base|) (= (store |v_#memory_int_48| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse38 .cse12 1)) |c_#memory_int|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_16| 0))))))) (<= (+ |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 1) |c_#StackHeapBarrier|) (= (select |v_#valid_30| 1) 1) (= |v_#memory_int_32| (store |v_#memory_int_33| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse46 4 (select .cse23 4)))) (= 0 (select .cse45 |v_ULTIMATE.start_main_#t~malloc3#1.base_13|)) (= 2 (select |v_#length_20| 1)) (= |v_#memory_int_33| (store |v_#memory_int_115| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |v_#memory_int_115| |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse46 0)))) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_13| 0)) (= |v_#memory_int_45| (store |v_#memory_int_50| .cse30 (store (select |v_#memory_int_50| .cse30) .cse28 (select .cse37 .cse28)))) (= (select .cse26 0) 48) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_15| 2147483648)))))))) (exists ((|v_ULTIMATE.start_main_#t~nondet2#1_22| Int)) (and (<= |v_ULTIMATE.start_main_#t~nondet2#1_22| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet2#1_22| 2147483648)) (not (= |v_ULTIMATE.start_main_#t~nondet2#1_22| 0)))) (<= (+ |c_ULTIMATE.start_main_~list~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) .cse12) 1) (<= 1 |c_#StackHeapBarrier|))) is different from false [2024-11-14 03:15:41,929 WARN L286 SmtUtils]: Spent 51.40s on a formula simplification. DAG size of input: 409 DAG size of output: 406 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:15:53,387 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1005#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) 8) 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (not (= |ULTIMATE.start_main_~end~0#1.base| 0)))' at error location [2024-11-14 03:15:53,388 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:15:53,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:15:53,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2024-11-14 03:15:53,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786558327] [2024-11-14 03:15:53,388 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-14 03:15:53,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:15:53,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:15:53,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:15:53,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=173, Unknown=19, NotChecked=58, Total=306 [2024-11-14 03:15:53,389 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:04,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:04,601 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-11-14 03:16:04,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:16:04,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-14 03:16:04,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:04,602 INFO L225 Difference]: With dead ends: 68 [2024-11-14 03:16:04,602 INFO L226 Difference]: Without dead ends: 66 [2024-11-14 03:16:04,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 151.2s TimeCoverageRelationStatistics Valid=72, Invalid=255, Unknown=23, NotChecked=70, Total=420 [2024-11-14 03:16:04,603 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 48 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:04,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 93 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:16:04,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-14 03:16:04,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2024-11-14 03:16:04,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.127659574468085) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2024-11-14 03:16:04,618 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 19 [2024-11-14 03:16:04,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:04,618 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-11-14 03:16:04,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:04,618 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2024-11-14 03:16:04,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 03:16:04,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:04,619 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:16:04,634 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 03:16:04,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:04,820 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-14 03:16:04,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:04,821 INFO L85 PathProgramCache]: Analyzing trace with hash -872857730, now seen corresponding path program 1 times [2024-11-14 03:16:04,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:04,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933278837] [2024-11-14 03:16:04,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:04,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:06,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:16:06,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:06,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933278837] [2024-11-14 03:16:06,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933278837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:16:06,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180026427] [2024-11-14 03:16:06,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:06,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:06,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:16:06,928 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:16:06,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 03:16:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:07,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-14 03:16:07,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:16:07,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:16:07,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:16:07,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 484 treesize of output 476 [2024-11-14 03:16:07,322 INFO L349 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2024-11-14 03:16:07,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 650 treesize of output 584 [2024-11-14 03:16:07,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 626 treesize of output 641 [2024-11-14 03:16:07,733 INFO L349 Elim1Store]: treesize reduction 109, result has 33.9 percent of original size [2024-11-14 03:16:07,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 581 treesize of output 644 [2024-11-14 03:16:07,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:16:07,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 327 treesize of output 318 [2024-11-14 03:16:07,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 287 treesize of output 315 [2024-11-14 03:16:07,902 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2024-11-14 03:16:07,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 265 treesize of output 301 [2024-11-14 03:16:07,947 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 20 treesize of output 1 [2024-11-14 03:16:08,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 451 treesize of output 562 [2024-11-14 03:16:08,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:16:08,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 57 [2024-11-14 03:16:08,425 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:16:08,425 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:16:08,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 57 [2024-11-14 03:16:08,647 INFO L349 Elim1Store]: treesize reduction 362, result has 4.0 percent of original size [2024-11-14 03:16:08,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 367 treesize of output 478 [2024-11-14 03:16:08,660 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 221 treesize of output 219 [2024-11-14 03:16:08,762 INFO L349 Elim1Store]: treesize reduction 188, result has 0.5 percent of original size [2024-11-14 03:16:08,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 252 treesize of output 67 [2024-11-14 03:16:08,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-11-14 03:16:08,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 159 [2024-11-14 03:16:09,027 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 10 treesize of output 8 [2024-11-14 03:16:09,043 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 75 treesize of output 61 [2024-11-14 03:16:09,138 INFO L349 Elim1Store]: treesize reduction 74, result has 6.3 percent of original size [2024-11-14 03:16:09,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 88 [2024-11-14 03:16:09,250 INFO L349 Elim1Store]: treesize reduction 12, result has 75.5 percent of original size [2024-11-14 03:16:09,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 165 [2024-11-14 03:16:11,211 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 161 treesize of output 149 [2024-11-14 03:16:11,223 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 91 treesize of output 89 [2024-11-14 03:16:11,608 INFO L349 Elim1Store]: treesize reduction 8, result has 86.9 percent of original size [2024-11-14 03:16:11,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 136 [2024-11-14 03:16:21,386 WARN L286 SmtUtils]: Spent 7.24s on a formula simplification. DAG size of input: 723 DAG size of output: 675 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 03:16:21,387 INFO L349 Elim1Store]: treesize reduction 96, result has 93.0 percent of original size [2024-11-14 03:16:21,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 25 new quantified variables, introduced 171 case distinctions, treesize of input 403 treesize of output 1465 [2024-11-14 03:20:52,174 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-14 03:20:52,174 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2024-11-14 03:20:52,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [604860437] [2024-11-14 03:20:52,176 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-11-14 03:20:52,177 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 03:20:52,177 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:20:52,177 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:20:52,177 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:20:52,178 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:20:52,189 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:326) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: 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) ... 44 more [2024-11-14 03:20:52,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:20:52,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-11-14 03:20:52,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682985498] [2024-11-14 03:20:52,198 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-14 03:20:52,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 03:20:52,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:20:52,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 03:20:52,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-14 03:20:52,200 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:52,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-14 03:20:52,204 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:52,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:20:52,226 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 03:20:52,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-14 03:20:52,405 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_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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.unAssertCodeBlock(IncrementalHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:278) 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:385) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:345) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: 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-11-14 03:20:52,408 INFO L158 Benchmark]: Toolchain (without parser) took 471946.99ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 116.4MB in the beginning and 664.8MB in the end (delta: -548.4MB). Peak memory consumption was 841.1MB. Max. memory is 16.1GB. [2024-11-14 03:20:52,410 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:20:52,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.75ms. Allocated memory is still 142.6MB. Free memory was 116.1MB in the beginning and 98.3MB in the end (delta: 17.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:20:52,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.11ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 96.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:20:52,410 INFO L158 Benchmark]: Boogie Preprocessor took 45.13ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 95.2MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:20:52,411 INFO L158 Benchmark]: RCFGBuilder took 547.78ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 72.8MB in the end (delta: 22.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 03:20:52,411 INFO L158 Benchmark]: TraceAbstraction took 470786.48ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 72.3MB in the beginning and 664.8MB in the end (delta: -592.4MB). Peak memory consumption was 807.6MB. Max. memory is 16.1GB. [2024-11-14 03:20:52,413 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.35ms. Allocated memory is still 117.4MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 503.75ms. Allocated memory is still 142.6MB. Free memory was 116.1MB in the beginning and 98.3MB in the end (delta: 17.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.11ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 96.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.13ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 95.2MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 547.78ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 72.8MB in the end (delta: 22.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 470786.48ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 72.3MB in the beginning and 664.8MB in the end (delta: -592.4MB). Peak memory consumption was 807.6MB. 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_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:20:54,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:20:55,081 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 03:20:55,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:20:55,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:20:55,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:20:55,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:20:55,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:20:55,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:20:55,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:20:55,133 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:20:55,134 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:20:55,134 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:20:55,134 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:20:55,134 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:20:55,134 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:20:55,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:20:55,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:20:55,135 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:20:55,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:20:55,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:20:55,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:20:55,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:20:55,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:20:55,136 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:20:55,136 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 03:20:55,136 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:20:55,136 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 03:20:55,137 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:20:55,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:20:55,137 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:20:55,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:20:55,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 03:20:55,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:20:55,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:20:55,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:20:55,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:20:55,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:20:55,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:20:55,138 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 03:20:55,138 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 03:20:55,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:20:55,138 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:20:55,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2024-11-14 03:20:55,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:20:55,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:20:55,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:20:55,490 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:20:55,491 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:20:55,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i Unable to find full path for "g++" [2024-11-14 03:20:57,518 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:20:57,843 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:20:57,846 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2024-11-14 03:20:57,865 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/data/3b5a61c66/b48e0692f24f4e60854ced46fcb19862/FLAGaa689298a [2024-11-14 03:20:57,889 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/data/3b5a61c66/b48e0692f24f4e60854ced46fcb19862 [2024-11-14 03:20:57,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:20:57,896 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:20:57,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:20:57,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:20:57,904 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:20:57,905 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:20:57" (1/1) ... [2024-11-14 03:20:57,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27cba9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:57, skipping insertion in model container [2024-11-14 03:20:57,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:20:57" (1/1) ... [2024-11-14 03:20:57,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:20:58,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22569,22582] [2024-11-14 03:20:58,337 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22645,22658] [2024-11-14 03:20:58,340 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22715,22728] [2024-11-14 03:20:58,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22822,22835] [2024-11-14 03:20:58,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22894,22907] [2024-11-14 03:20:58,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23045,23058] [2024-11-14 03:20:58,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23119,23132] [2024-11-14 03:20:58,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:20:58,369 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:20:58,421 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22569,22582] [2024-11-14 03:20:58,423 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22645,22658] [2024-11-14 03:20:58,424 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22715,22728] [2024-11-14 03:20:58,425 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22822,22835] [2024-11-14 03:20:58,426 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22894,22907] [2024-11-14 03:20:58,428 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23045,23058] [2024-11-14 03:20:58,429 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23119,23132] [2024-11-14 03:20:58,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:20:58,468 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:20:58,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:58 WrapperNode [2024-11-14 03:20:58,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:20:58,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:20:58,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:20:58,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:20:58,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:58" (1/1) ... [2024-11-14 03:20:58,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:58" (1/1) ... [2024-11-14 03:20:58,539 INFO L138 Inliner]: procedures = 122, calls = 39, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 140 [2024-11-14 03:20:58,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:20:58,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:20:58,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:20:58,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:20:58,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:58" (1/1) ... [2024-11-14 03:20:58,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:58" (1/1) ... [2024-11-14 03:20:58,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:58" (1/1) ... [2024-11-14 03:20:58,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:58" (1/1) ... [2024-11-14 03:20:58,577 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:58" (1/1) ... [2024-11-14 03:20:58,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:58" (1/1) ... [2024-11-14 03:20:58,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:58" (1/1) ... [2024-11-14 03:20:58,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:58" (1/1) ... [2024-11-14 03:20:58,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:20:58,597 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:20:58,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:20:58,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:20:58,599 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:58" (1/1) ... [2024-11-14 03:20:58,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:20:58,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:20:58,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:20:58,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:20:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 03:20:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:20:58,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:20:58,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:20:58,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:20:58,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:20:58,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 03:20:58,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 03:20:58,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:20:58,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:20:58,835 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:20:58,838 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:21:00,025 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-14 03:21:00,026 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:21:00,037 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:21:00,037 INFO L316 CfgBuilder]: Removed 17 assume(true) statements. [2024-11-14 03:21:00,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:21:00 BoogieIcfgContainer [2024-11-14 03:21:00,038 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:21:00,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:21:00,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:21:00,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:21:00,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:20:57" (1/3) ... [2024-11-14 03:21:00,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c81797b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:21:00, skipping insertion in model container [2024-11-14 03:21:00,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:58" (2/3) ... [2024-11-14 03:21:00,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c81797b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:21:00, skipping insertion in model container [2024-11-14 03:21:00,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:21:00" (3/3) ... [2024-11-14 03:21:00,048 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2024-11-14 03:21:00,063 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:21:00,064 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-rb-cnstr_1-1.i that has 1 procedures, 47 locations, 1 initial locations, 10 loop locations, and 7 error locations. [2024-11-14 03:21:00,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:21:00,131 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@35cd8e3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:21:00,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-14 03:21:00,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 46 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-11-14 03:21:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:21:00,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:00,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:21:00,142 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-14 03:21:00,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:00,146 INFO L85 PathProgramCache]: Analyzing trace with hash 891569350, now seen corresponding path program 1 times [2024-11-14 03:21:00,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:00,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744547271] [2024-11-14 03:21:00,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:00,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:21:00,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:00,163 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:21:00,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-14 03:21:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:00,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 03:21:00,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:21:00,314 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:21:00,315 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:00,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744547271] [2024-11-14 03:21:00,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744547271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:21:00,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:21:00,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:21:00,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380665360] [2024-11-14 03:21:00,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:21:00,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 03:21:00,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:00,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 03:21:00,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 03:21:00,346 INFO L87 Difference]: Start difference. First operand has 47 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 46 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:00,364 INFO L93 Difference]: Finished difference Result 92 states and 150 transitions. [2024-11-14 03:21:00,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:21:00,366 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 03:21:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:00,375 INFO L225 Difference]: With dead ends: 92 [2024-11-14 03:21:00,375 INFO L226 Difference]: Without dead ends: 41 [2024-11-14 03:21:00,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 03:21:00,382 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:00,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:21:00,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-14 03:21:00,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-14 03:21:00,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-11-14 03:21:00,414 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 6 [2024-11-14 03:21:00,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:00,416 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-11-14 03:21:00,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:00,417 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-14 03:21:00,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 03:21:00,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:00,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:21:00,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-14 03:21:00,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:21:00,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-14 03:21:00,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:00,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1805951557, now seen corresponding path program 1 times [2024-11-14 03:21:00,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:00,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159513445] [2024-11-14 03:21:00,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:00,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:21:00,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:00,623 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:21:00,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-14 03:21:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:00,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:21:00,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:21:00,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:21:00,789 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:00,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159513445] [2024-11-14 03:21:00,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159513445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:21:00,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:21:00,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:21:00,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223130037] [2024-11-14 03:21:00,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:21:00,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:21:00,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:00,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:21:00,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:21:00,792 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:01,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:01,043 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2024-11-14 03:21:01,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:21:01,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-14 03:21:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:01,045 INFO L225 Difference]: With dead ends: 44 [2024-11-14 03:21:01,047 INFO L226 Difference]: Without dead ends: 40 [2024-11-14 03:21:01,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:21:01,048 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 64 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:01,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 37 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:21:01,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-14 03:21:01,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2024-11-14 03:21:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:01,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-14 03:21:01,066 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 7 [2024-11-14 03:21:01,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:01,067 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-14 03:21:01,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:01,067 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-14 03:21:01,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 03:21:01,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:01,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:21:01,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-14 03:21:01,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:21:01,268 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-14 03:21:01,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:01,269 INFO L85 PathProgramCache]: Analyzing trace with hash 149983149, now seen corresponding path program 1 times [2024-11-14 03:21:01,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:01,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753119696] [2024-11-14 03:21:01,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:01,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:21:01,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:01,275 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:21:01,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-14 03:21:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:01,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:21:01,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:01,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:21:01,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:21:01,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:21:01,516 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:01,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753119696] [2024-11-14 03:21:01,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1753119696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:21:01,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:21:01,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:21:01,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719581199] [2024-11-14 03:21:01,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:21:01,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:21:01,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:01,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:21:01,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:21:01,518 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:02,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:02,190 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-11-14 03:21:02,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:21:02,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-14 03:21:02,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:02,192 INFO L225 Difference]: With dead ends: 37 [2024-11-14 03:21:02,192 INFO L226 Difference]: Without dead ends: 35 [2024-11-14 03:21:02,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:21:02,193 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:02,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 77 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 03:21:02,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-14 03:21:02,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-14 03:21:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-14 03:21:02,209 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 8 [2024-11-14 03:21:02,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:02,212 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-14 03:21:02,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:02,212 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-14 03:21:02,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 03:21:02,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:02,213 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:21:02,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-14 03:21:02,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:21:02,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-14 03:21:02,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:02,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1948485352, now seen corresponding path program 1 times [2024-11-14 03:21:02,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:02,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924434280] [2024-11-14 03:21:02,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:02,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:21:02,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:02,419 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:21:02,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-14 03:21:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:02,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:21:02,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:02,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:21:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:21:02,603 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:21:02,603 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:02,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924434280] [2024-11-14 03:21:02,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924434280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:21:02,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:21:02,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:21:02,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466063240] [2024-11-14 03:21:02,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:21:02,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:21:02,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:02,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:21:02,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:21:02,606 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:03,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:03,629 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2024-11-14 03:21:03,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:21:03,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-14 03:21:03,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:03,631 INFO L225 Difference]: With dead ends: 60 [2024-11-14 03:21:03,631 INFO L226 Difference]: Without dead ends: 58 [2024-11-14 03:21:03,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:21:03,632 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:03,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 88 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 03:21:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-14 03:21:03,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2024-11-14 03:21:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-11-14 03:21:03,650 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 10 [2024-11-14 03:21:03,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:03,652 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-11-14 03:21:03,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2024-11-14 03:21:03,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 03:21:03,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:03,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:21:03,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-14 03:21:03,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:21:03,855 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-14 03:21:03,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:03,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1385944471, now seen corresponding path program 1 times [2024-11-14 03:21:03,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:03,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056040592] [2024-11-14 03:21:03,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:03,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:21:03,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:03,858 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:21:03,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-14 03:21:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:04,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 03:21:04,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:04,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2024-11-14 03:21:04,148 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 8 treesize of output 1 [2024-11-14 03:21:04,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2024-11-14 03:21:04,175 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 8 treesize of output 1 [2024-11-14 03:21:04,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2024-11-14 03:21:04,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2024-11-14 03:21:04,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:04,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2024-11-14 03:21:04,296 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 19 treesize of output 7 [2024-11-14 03:21:04,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:04,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 27 treesize of output 19 [2024-11-14 03:21:04,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:04,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:21:04,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:04,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:04,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2024-11-14 03:21:04,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-14 03:21:04,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2024-11-14 03:21:04,447 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 03:21:04,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 40 treesize of output 48 [2024-11-14 03:21:04,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:04,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2024-11-14 03:21:04,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 03:21:04,565 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 19 treesize of output 7 [2024-11-14 03:21:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:21:04,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:21:04,698 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:04,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056040592] [2024-11-14 03:21:04,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056040592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:21:04,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:21:04,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:21:04,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490854508] [2024-11-14 03:21:04,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:21:04,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:21:04,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:04,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:21:04,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:21:04,702 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 4 states, 4 states have (on average 2.75) 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-11-14 03:21:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:06,125 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-11-14 03:21:06,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:21:06,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) 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-11-14 03:21:06,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:06,127 INFO L225 Difference]: With dead ends: 42 [2024-11-14 03:21:06,127 INFO L226 Difference]: Without dead ends: 40 [2024-11-14 03:21:06,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:21:06,128 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:06,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-14 03:21:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-14 03:21:06,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-14 03:21:06,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-11-14 03:21:06,139 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 11 [2024-11-14 03:21:06,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:06,139 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-11-14 03:21:06,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) 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-11-14 03:21:06,139 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-11-14 03:21:06,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 03:21:06,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:06,140 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:21:06,145 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-14 03:21:06,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:21:06,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-14 03:21:06,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:06,345 INFO L85 PathProgramCache]: Analyzing trace with hash -273205825, now seen corresponding path program 1 times [2024-11-14 03:21:06,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:06,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603563631] [2024-11-14 03:21:06,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:06,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:21:06,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:06,349 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:21:06,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-14 03:21:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:06,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 03:21:06,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:06,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:21:06,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:21:06,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:21:06,546 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:06,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603563631] [2024-11-14 03:21:06,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603563631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:21:06,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:21:06,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:21:06,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661250695] [2024-11-14 03:21:06,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:21:06,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:21:06,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:06,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:21:06,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:21:06,550 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-11-14 03:21:07,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:07,964 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2024-11-14 03:21:07,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:21:07,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-11-14 03:21:07,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:07,966 INFO L225 Difference]: With dead ends: 68 [2024-11-14 03:21:07,966 INFO L226 Difference]: Without dead ends: 56 [2024-11-14 03:21:07,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:21:07,967 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 36 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:07,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 84 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-14 03:21:07,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-14 03:21:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2024-11-14 03:21:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:07,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-11-14 03:21:07,976 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 14 [2024-11-14 03:21:07,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:07,977 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-11-14 03:21:07,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-11-14 03:21:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-11-14 03:21:07,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 03:21:07,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:07,978 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:21:07,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-14 03:21:08,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:21:08,181 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-14 03:21:08,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:08,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1007422240, now seen corresponding path program 1 times [2024-11-14 03:21:08,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:08,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517219781] [2024-11-14 03:21:08,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:08,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:21:08,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:08,183 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:21:08,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-14 03:21:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:08,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 03:21:08,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:08,288 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 27 treesize of output 17 [2024-11-14 03:21:08,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 7 [2024-11-14 03:21:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:21:08,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:08,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:21:08,805 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:08,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517219781] [2024-11-14 03:21:08,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517219781] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:21:08,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1408376072] [2024-11-14 03:21:08,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:08,807 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:21:08,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:21:08,817 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:21:08,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-14 03:21:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:08,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 03:21:08,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:09,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:21:09,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-14 03:21:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:21:09,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:21:09,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1408376072] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:21:09,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287979772] [2024-11-14 03:21:09,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:09,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:21:09,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:21:09,512 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:21:09,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 03:21:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:09,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 03:21:09,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:09,634 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 33 treesize of output 7 [2024-11-14 03:21:09,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2024-11-14 03:21:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:21:09,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:21:10,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287979772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:21:10,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 03:21:10,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 9 [2024-11-14 03:21:10,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744799792] [2024-11-14 03:21:10,017 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 03:21:10,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 03:21:10,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:10,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 03:21:10,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:21:10,020 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:12,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:12,067 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2024-11-14 03:21:12,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:21:12,068 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-14 03:21:12,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:12,068 INFO L225 Difference]: With dead ends: 57 [2024-11-14 03:21:12,068 INFO L226 Difference]: Without dead ends: 35 [2024-11-14 03:21:12,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:21:12,069 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 64 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:12,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 83 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-14 03:21:12,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-14 03:21:12,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-14 03:21:12,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:12,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-14 03:21:12,081 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 17 [2024-11-14 03:21:12,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:12,081 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-14 03:21:12,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:12,081 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-14 03:21:12,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:21:12,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:12,082 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:21:12,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 03:21:12,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-14 03:21:12,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-14 03:21:12,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:21:12,686 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-14 03:21:12,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:12,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1956681293, now seen corresponding path program 1 times [2024-11-14 03:21:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:12,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166771028] [2024-11-14 03:21:12,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:12,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:21:12,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:12,693 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:21:12,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-14 03:21:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:12,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 03:21:12,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:12,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:21:12,936 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-11-14 03:21:13,048 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 03:21:13,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2024-11-14 03:21:13,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2024-11-14 03:21:13,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:13,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 03:21:13,091 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 35 treesize of output 18 [2024-11-14 03:21:13,098 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 18 treesize of output 11 [2024-11-14 03:21:13,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2024-11-14 03:21:13,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 47 [2024-11-14 03:21:13,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-14 03:21:13,163 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2024-11-14 03:21:13,257 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 03:21:13,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 46 [2024-11-14 03:21:13,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:13,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 43 treesize of output 35 [2024-11-14 03:21:13,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 50 [2024-11-14 03:21:13,331 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 111 treesize of output 75 [2024-11-14 03:21:13,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:13,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2024-11-14 03:21:13,375 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 7 [2024-11-14 03:21:13,405 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:21:13,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2024-11-14 03:21:13,438 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 03:21:13,446 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 03:21:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:21:13,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:14,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:14,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2024-11-14 03:21:14,062 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 100 treesize of output 92 [2024-11-14 03:21:14,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:14,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 78 [2024-11-14 03:21:14,086 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 170 treesize of output 126 [2024-11-14 03:21:14,097 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 31 treesize of output 29 [2024-11-14 03:21:14,107 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 29 treesize of output 27 [2024-11-14 03:21:14,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:14,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 75 [2024-11-14 03:21:14,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:14,216 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:21:14,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 4 [2024-11-14 03:21:14,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:14,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 265 treesize of output 226 [2024-11-14 03:21:14,985 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 417 treesize of output 321 [2024-11-14 03:21:15,001 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 287 treesize of output 275 [2024-11-14 03:21:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:21:26,671 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:26,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166771028] [2024-11-14 03:21:26,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166771028] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:21:26,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [521840898] [2024-11-14 03:21:26,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:26,672 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:21:26,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:21:26,674 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:21:26,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-14 03:21:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:26,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-14 03:21:26,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:26,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:21:26,947 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-11-14 03:21:27,011 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 03:21:27,088 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 03:21:27,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-14 03:21:27,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2024-11-14 03:21:27,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:27,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 03:21:27,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-11-14 03:21:27,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:21:27,250 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 03:21:27,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 46 [2024-11-14 03:21:27,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:27,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 43 treesize of output 35 [2024-11-14 03:21:27,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 50 [2024-11-14 03:21:27,344 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 111 treesize of output 75 [2024-11-14 03:21:27,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:27,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2024-11-14 03:21:27,400 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 7 [2024-11-14 03:21:27,455 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:21:27,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2024-11-14 03:21:27,487 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 03:21:27,492 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 03:21:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:21:28,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:28,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:28,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2024-11-14 03:21:28,167 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 100 treesize of output 92 [2024-11-14 03:21:28,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:28,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 78 [2024-11-14 03:21:28,196 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 170 treesize of output 126 [2024-11-14 03:21:28,208 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 31 treesize of output 29 [2024-11-14 03:21:28,223 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 29 treesize of output 27 [2024-11-14 03:21:28,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:28,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 75 [2024-11-14 03:21:28,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:28,335 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-14 03:21:28,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 4 [2024-11-14 03:21:32,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:32,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 279 treesize of output 240 [2024-11-14 03:21:32,508 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 451 treesize of output 355 [2024-11-14 03:21:32,525 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 316 treesize of output 304 [2024-11-14 03:22:00,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:22:00,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [521840898] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:22:00,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661932734] [2024-11-14 03:22:00,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:00,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:22:00,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:22:00,425 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:22:00,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 03:22:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:00,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 03:22:00,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:22:00,575 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-11-14 03:22:00,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:22:00,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-11-14 03:22:00,821 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 03:22:00,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 03:22:00,976 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 03:22:00,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-14 03:22:01,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2024-11-14 03:22:01,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:22:01,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 03:22:01,075 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 03:22:01,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 56 [2024-11-14 03:22:01,121 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 115 treesize of output 75 [2024-11-14 03:22:01,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:22:01,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2024-11-14 03:22:01,220 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:22:01,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2024-11-14 03:22:01,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 62 [2024-11-14 03:22:01,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 50 [2024-11-14 03:22:01,282 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 94 treesize of output 58 [2024-11-14 03:22:01,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 56 [2024-11-14 03:22:01,319 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 100 treesize of output 60 [2024-11-14 03:22:06,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:22:06,878 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:22:07,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:22:07,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2024-11-14 03:22:07,101 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 71 treesize of output 51 [2024-11-14 03:22:07,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-14 03:22:15,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:22:15,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 192 [2024-11-14 03:22:15,886 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 403 treesize of output 307 [2024-11-14 03:22:15,905 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 268 treesize of output 256 [2024-11-14 03:22:21,192 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse2 (store |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base| (_ bv1 1))) (.cse3 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base|))))) (and (or (forall ((v_prenex_251 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_prenex_253 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_60 (_ BitVec 32)) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_508) v_arrayElimCell_60 v_ArrVal_518))) (or (= (_ bv1 32) (select (select (store .cse0 v_arrayElimCell_57 v_prenex_252) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (not (= (_ bv0 1) (select .cse2 v_arrayElimCell_57))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_518) v_arrayElimCell_57 v_prenex_252) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store (store .cse0 v_arrayElimCell_57 v_prenex_253) v_prenex_251 v_prenex_252) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))) .cse3) (forall ((v_arrayElimCell_59 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_59))) (forall ((v_ArrVal_513 (_ BitVec 32)) (v_prenex_256 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_255 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_254 (_ BitVec 32))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_513)) v_arrayElimCell_59 v_prenex_256) v_prenex_254 v_prenex_255) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_59 (_ bv1 1)) v_prenex_254))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_59))) (or .cse3 (forall ((v_prenex_256 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_255 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_60 (_ BitVec 32)) (v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_254 (_ BitVec 32))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_508) v_arrayElimCell_60 v_prenex_256) v_prenex_254 v_prenex_255) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_prenex_254 v_arrayElimCell_60) (not (= (_ bv0 1) (select .cse2 v_prenex_254)))))) (forall ((v_arrayElimCell_59 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_59))) (forall ((v_arrayElimCell_57 (_ BitVec 32))) (or (forall ((v_ArrVal_513 (_ BitVec 32)) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_252 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_513)))) (let ((.cse5 (store .cse6 v_arrayElimCell_59 v_ArrVal_518))) (or (= (_ bv1 32) (select (select (store .cse5 v_arrayElimCell_57 v_prenex_252) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (forall ((v_arrayElimCell_60 (_ BitVec 32)) (v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse6 v_arrayElimCell_59 v_ArrVal_508) v_arrayElimCell_60 v_ArrVal_518) v_arrayElimCell_57 v_prenex_252) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (forall ((v_prenex_251 (_ BitVec 32)) (v_prenex_253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store .cse5 v_arrayElimCell_57 v_prenex_253) v_prenex_251 v_prenex_252) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_59 (_ bv1 1)) v_arrayElimCell_57))))))) (or .cse3 (and (forall ((v_arrayElimCell_57 (_ BitVec 32))) (or (forall ((v_prenex_251 (_ BitVec 32)) (v_prenex_253 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_60 (_ BitVec 32)) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_508) v_arrayElimCell_60 v_ArrVal_518))) (or (= (_ bv1 32) (select (select (store .cse7 v_arrayElimCell_57 v_prenex_252) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store (store .cse7 v_arrayElimCell_57 v_prenex_253) v_prenex_251 v_prenex_252) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))) (not (= (_ bv0 1) (select .cse2 v_arrayElimCell_57))))) (forall ((v_arrayElimCell_57 (_ BitVec 32))) (or (forall ((v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_252 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_60 (_ BitVec 32)) (v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_508) v_arrayElimCell_60 v_ArrVal_518) v_arrayElimCell_57 v_prenex_252) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (forall ((v_prenex_251 (_ BitVec 32)) (v_prenex_253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_518) v_arrayElimCell_57 v_prenex_253) v_prenex_251 v_prenex_252) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))) (not (= (_ bv0 1) (select .cse2 v_arrayElimCell_57))))))) (forall ((v_arrayElimCell_59 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_59))) (forall ((v_prenex_251 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_prenex_253 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_513 (_ BitVec 32)) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_252 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_513)) v_arrayElimCell_59 v_ArrVal_518))) (or (= (_ bv1 32) (select (select (store .cse8 v_arrayElimCell_57 v_prenex_252) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (_ bv1 32) (select (select (store (store .cse8 v_arrayElimCell_57 v_prenex_253) v_prenex_251 v_prenex_252) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_59 (_ bv1 1)) v_arrayElimCell_57)))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_59))) (forall ((v_arrayElimCell_59 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_59))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_59) (forall ((v_prenex_254 (_ BitVec 32))) (or (forall ((v_ArrVal_513 (_ BitVec 32)) (v_prenex_256 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_255 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_60 (_ BitVec 32)) (v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_513)))) (or (= (_ bv1 32) (select (select (store (store (store .cse9 v_arrayElimCell_59 v_ArrVal_508) v_arrayElimCell_60 v_prenex_256) v_prenex_254 v_prenex_255) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (_ bv1 32) (select (select (store (store .cse9 v_arrayElimCell_59 v_prenex_256) v_prenex_254 v_prenex_255) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_59 (_ bv1 1)) v_prenex_254))))))) (forall ((v_arrayElimCell_59 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_59))) (forall ((v_prenex_254 (_ BitVec 32))) (or (forall ((v_ArrVal_513 (_ BitVec 32)) (v_prenex_256 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_513)) v_arrayElimCell_59 v_prenex_256) v_prenex_254 v_prenex_255) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_59 (_ bv1 1)) v_prenex_254))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_59))) (forall ((v_arrayElimCell_59 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_59))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_59) (forall ((v_prenex_251 (_ BitVec 32)) (v_arrayElimCell_57 (_ BitVec 32)) (v_prenex_253 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_513 (_ BitVec 32)) (v_arrayElimCell_60 (_ BitVec 32)) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_513)))) (or (= (_ bv1 32) (select (select (store (store .cse10 v_arrayElimCell_59 v_ArrVal_518) v_arrayElimCell_57 v_prenex_252) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store (store (store (store .cse10 v_arrayElimCell_59 v_ArrVal_508) v_arrayElimCell_60 v_ArrVal_518) v_arrayElimCell_57 v_prenex_253) v_prenex_251 v_prenex_252) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_59 (_ bv1 1)) v_arrayElimCell_57)))))))) (forall ((v_arrayElimCell_59 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_59))) (forall ((v_prenex_254 (_ BitVec 32))) (or (forall ((v_arrayElimCell_60 (_ BitVec 32))) (or (forall ((v_ArrVal_513 (_ BitVec 32)) (v_prenex_256 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_513)))) (or (= (_ bv1 32) (select (select (store (store (store .cse11 v_arrayElimCell_59 v_ArrVal_508) v_arrayElimCell_60 v_prenex_256) v_prenex_254 v_prenex_255) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (_ bv1 32) (select (select (store (store .cse11 v_arrayElimCell_59 v_prenex_256) v_prenex_254 v_prenex_255) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))) (= v_prenex_254 v_arrayElimCell_60))) (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_59 (_ bv1 1)) v_prenex_254))))))) (or (forall ((v_arrayElimCell_58 (_ BitVec 32)) (v_arrayElimCell_60 (_ BitVec 32)) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_508) v_arrayElimCell_60 v_ArrVal_519) v_arrayElimCell_58 v_ArrVal_517) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (not (= (_ bv0 1) (select .cse2 v_arrayElimCell_60))))) .cse3))) is different from true [2024-11-14 03:22:22,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-14 03:22:22,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661932734] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:22:22,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 03:22:22,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 7] total 17 [2024-11-14 03:22:22,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394811156] [2024-11-14 03:22:22,307 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 03:22:22,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-14 03:22:22,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:22:22,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-14 03:22:22,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=170, Unknown=24, NotChecked=28, Total=272 [2024-11-14 03:22:22,308 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 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-11-14 03:22:25,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:22:30,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:22:35,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:22:38,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:22:40,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:22:42,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:22:45,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:22:47,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:22:49,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:22:51,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:22:53,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:22:55,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:22:57,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:22:59,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:23:01,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:23:03,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:23:06,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:23:08,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:23:10,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:23:12,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:23:14,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:23:17,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:23:19,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:23:21,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:23:23,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:23:25,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:23:27,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:23:28,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:23:30,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:23:32,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:23:34,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:23:36,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:23:36,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:23:36,794 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2024-11-14 03:23:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:23:36,801 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 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 21 [2024-11-14 03:23:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:23:36,802 INFO L225 Difference]: With dead ends: 81 [2024-11-14 03:23:36,802 INFO L226 Difference]: Without dead ends: 79 [2024-11-14 03:23:36,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 48.8s TimeCoverageRelationStatistics Valid=138, Invalid=348, Unknown=24, NotChecked=42, Total=552 [2024-11-14 03:23:36,803 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 150 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 18 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 72.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:23:36,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 157 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 159 Invalid, 26 Unknown, 86 Unchecked, 72.8s Time] [2024-11-14 03:23:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-14 03:23:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 33. [2024-11-14 03:23:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 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-11-14 03:23:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-14 03:23:36,814 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2024-11-14 03:23:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:23:36,814 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-14 03:23:36,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 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-11-14 03:23:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-14 03:23:36,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 03:23:36,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:23:36,815 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:23:36,832 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-14 03:23:37,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-11-14 03:23:37,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-14 03:23:37,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:23:37,416 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-14 03:23:37,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:23:37,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1664458534, now seen corresponding path program 1 times [2024-11-14 03:23:37,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:23:37,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438377074] [2024-11-14 03:23:37,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:23:37,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:23:37,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:23:37,418 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:23:37,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-14 03:23:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:23:37,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:23:37,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:23:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:23:37,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:23:37,699 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:23:37,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438377074] [2024-11-14 03:23:37,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438377074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:23:37,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:23:37,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:23:37,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386800917] [2024-11-14 03:23:37,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:23:37,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:23:37,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:23:37,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:23:37,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:23:37,700 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:23:39,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:23:39,139 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2024-11-14 03:23:39,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:23:39,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-14 03:23:39,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:23:39,140 INFO L225 Difference]: With dead ends: 48 [2024-11-14 03:23:39,140 INFO L226 Difference]: Without dead ends: 36 [2024-11-14 03:23:39,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 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-11-14 03:23:39,141 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:23:39,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 73 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-14 03:23:39,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-14 03:23:39,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-11-14 03:23:39,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:23:39,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-14 03:23:39,151 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 25 [2024-11-14 03:23:39,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:23:39,151 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-14 03:23:39,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:23:39,151 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-14 03:23:39,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:23:39,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:23:39,152 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:23:39,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-14 03:23:39,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:23:39,353 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-14 03:23:39,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:23:39,353 INFO L85 PathProgramCache]: Analyzing trace with hash 632374821, now seen corresponding path program 1 times [2024-11-14 03:23:39,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:23:39,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524605144] [2024-11-14 03:23:39,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:23:39,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:23:39,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:23:39,357 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:23:39,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f44e9230-f2af-4fd3-93e5-9f960d889fe8/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-14 03:23:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:23:39,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 03:23:39,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:23:39,655 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-11-14 03:23:39,847 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:23:39,853 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 03:23:39,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-14 03:23:39,881 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:23:39,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2024-11-14 03:23:39,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 03:23:39,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 03:23:39,933 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:23:39,939 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 14 treesize of output 5 [2024-11-14 03:23:39,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 03:23:39,963 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2024-11-14 03:23:39,973 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:23:39,977 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 03:23:39,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-14 03:23:40,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:23:40,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:23:40,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2024-11-14 03:23:40,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:23:40,122 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 21 treesize of output 7 [2024-11-14 03:23:40,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:23:40,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:23:40,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:23:40,368 INFO L349 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2024-11-14 03:23:40,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 59 [2024-11-14 03:23:40,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2024-11-14 03:23:40,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:23:40,452 INFO L349 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2024-11-14 03:23:40,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 67 [2024-11-14 03:23:40,472 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 48 treesize of output 28 [2024-11-14 03:23:40,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:23:40,525 INFO L349 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2024-11-14 03:23:40,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 63 [2024-11-14 03:23:40,540 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 48 treesize of output 28 [2024-11-14 03:23:40,563 INFO L349 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2024-11-14 03:23:40,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 199 treesize of output 143 [2024-11-14 03:23:40,578 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 99 treesize of output 79 [2024-11-14 03:23:40,592 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 64 treesize of output 50 [2024-11-14 03:23:40,597 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 03:23:40,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:23:40,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:23:40,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:23:40,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 71 [2024-11-14 03:23:40,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2024-11-14 03:23:40,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:23:40,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 72 [2024-11-14 03:23:40,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 03:23:40,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 03:23:40,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2024-11-14 03:23:40,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:23:40,839 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2024-11-14 03:23:40,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 95 [2024-11-14 03:23:40,922 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:23:40,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2024-11-14 03:23:40,976 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 16 treesize of output 15 [2024-11-14 03:23:43,768 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 03:23:43,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 79 [2024-11-14 03:23:44,776 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-14 03:23:44,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 38 [2024-11-14 03:23:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:23:44,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:23:46,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:23:46,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 189 [2024-11-14 03:23:46,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:23:46,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 133 [2024-11-14 03:23:50,672 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 562257 treesize of output 561873 [2024-11-14 03:23:50,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:23:50,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36869 treesize of output 23326