./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-80.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d1966bb592506b79b27027d67cb6c0fd6d8e652b34595ef57f8584495d162fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:39:10,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:39:10,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:39:10,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:39:10,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:39:10,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:39:10,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:39:10,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:39:10,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:39:10,486 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:39:10,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:39:10,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:39:10,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:39:10,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:39:10,487 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:39:10,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:39:10,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:39:10,487 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:39:10,487 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:39:10,487 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:39:10,487 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:39:10,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:39:10,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:39:10,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:39:10,489 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:39:10,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:39:10,490 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:39:10,490 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:39:10,490 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:39:10,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:39:10,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:39:10,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:39:10,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:39:10,491 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:39:10,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:39:10,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:39:10,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:39:10,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:39:10,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:39:10,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:39:10,491 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:39:10,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:39:10,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:39:10,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:39:10,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:39:10,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:39:10,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:39:10,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:39:10,492 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3d1966bb592506b79b27027d67cb6c0fd6d8e652b34595ef57f8584495d162fe [2025-01-09 15:39:10,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:39:10,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:39:10,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:39:10,774 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:39:10,775 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:39:10,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-80.i [2025-01-09 15:39:12,059 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2d1e2238/6d9f9719daff460199d93378efae0a3b/FLAG04c9f91dc [2025-01-09 15:39:12,321 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:39:12,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-80.i [2025-01-09 15:39:12,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2d1e2238/6d9f9719daff460199d93378efae0a3b/FLAG04c9f91dc [2025-01-09 15:39:12,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2d1e2238/6d9f9719daff460199d93378efae0a3b [2025-01-09 15:39:12,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:39:12,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:39:12,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:39:12,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:39:12,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:39:12,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:39:12" (1/1) ... [2025-01-09 15:39:12,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c20846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:12, skipping insertion in model container [2025-01-09 15:39:12,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:39:12" (1/1) ... [2025-01-09 15:39:12,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:39:12,526 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-80.i[917,930] [2025-01-09 15:39:12,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:39:12,654 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:39:12,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-80.i[917,930] [2025-01-09 15:39:12,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:39:12,755 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:39:12,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:12 WrapperNode [2025-01-09 15:39:12,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:39:12,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:39:12,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:39:12,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:39:12,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:12" (1/1) ... [2025-01-09 15:39:12,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:12" (1/1) ... [2025-01-09 15:39:12,825 INFO L138 Inliner]: procedures = 29, calls = 233, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 786 [2025-01-09 15:39:12,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:39:12,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:39:12,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:39:12,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:39:12,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:12" (1/1) ... [2025-01-09 15:39:12,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:12" (1/1) ... [2025-01-09 15:39:12,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:12" (1/1) ... [2025-01-09 15:39:12,873 INFO L175 MemorySlicer]: Split 199 memory accesses to 7 slices as follows [2, 6, 98, 36, 11, 23, 23]. 49 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 1, 8, 3, 1, 3, 1]. The 19 writes are split as follows [0, 1, 9, 4, 1, 3, 1]. [2025-01-09 15:39:12,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:12" (1/1) ... [2025-01-09 15:39:12,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:12" (1/1) ... [2025-01-09 15:39:12,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:12" (1/1) ... [2025-01-09 15:39:12,907 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:12" (1/1) ... [2025-01-09 15:39:12,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:12" (1/1) ... [2025-01-09 15:39:12,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:12" (1/1) ... [2025-01-09 15:39:12,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:12" (1/1) ... [2025-01-09 15:39:12,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:39:12,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:39:12,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:39:12,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:39:12,942 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:12" (1/1) ... [2025-01-09 15:39:12,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:39:12,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:39:12,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:39:12,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:39:13,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:39:13,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:39:13,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:39:13,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:39:13,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:39:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:39:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:39:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:39:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:39:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:39:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:39:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:39:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:39:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:39:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-01-09 15:39:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:39:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:39:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:39:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:39:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:39:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:39:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-01-09 15:39:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:39:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:39:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:39:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:39:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:39:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:39:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:39:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:39:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:39:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:39:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:39:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:39:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:39:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-01-09 15:39:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:39:13,012 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:39:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:39:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:39:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:39:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:39:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:39:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:39:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:39:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:39:13,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:39:13,198 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:39:13,200 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:39:13,960 INFO L? ?]: Removed 236 outVars from TransFormulas that were not future-live. [2025-01-09 15:39:13,960 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:39:13,974 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:39:13,974 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:39:13,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:39:13 BoogieIcfgContainer [2025-01-09 15:39:13,975 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:39:13,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:39:13,977 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:39:13,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:39:13,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:39:12" (1/3) ... [2025-01-09 15:39:13,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a701c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:39:13, skipping insertion in model container [2025-01-09 15:39:13,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:12" (2/3) ... [2025-01-09 15:39:13,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a701c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:39:13, skipping insertion in model container [2025-01-09 15:39:13,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:39:13" (3/3) ... [2025-01-09 15:39:13,985 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-80.i [2025-01-09 15:39:13,999 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:39:14,001 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-80.i that has 2 procedures, 153 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:39:14,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:39:14,081 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@7dd3ce06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:39:14,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:39:14,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 133 states have (on average 1.4511278195488722) internal successors, (193), 134 states have internal predecessors, (193), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:39:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:39:14,100 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:39:14,101 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:39:14,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:39:14,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:39:14,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2000206506, now seen corresponding path program 1 times [2025-01-09 15:39:14,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:39:14,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158936640] [2025-01-09 15:39:14,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:39:14,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:39:14,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:39:14,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:39:14,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:39:14,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:39:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-01-09 15:39:14,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:39:14,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158936640] [2025-01-09 15:39:14,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158936640] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:39:14,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542201649] [2025-01-09 15:39:14,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:39:14,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:39:14,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:39:14,577 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:39:14,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:39:14,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:39:14,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:39:14,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:39:14,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:39:14,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:39:14,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:39:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-01-09 15:39:14,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:39:14,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542201649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:39:14,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:39:14,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:39:14,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015740178] [2025-01-09 15:39:14,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:39:14,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:39:14,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:39:14,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:39:14,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:39:14,987 INFO L87 Difference]: Start difference. First operand has 153 states, 133 states have (on average 1.4511278195488722) internal successors, (193), 134 states have internal predecessors, (193), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:39:15,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:39:15,016 INFO L93 Difference]: Finished difference Result 300 states and 466 transitions. [2025-01-09 15:39:15,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:39:15,019 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 153 [2025-01-09 15:39:15,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:39:15,027 INFO L225 Difference]: With dead ends: 300 [2025-01-09 15:39:15,027 INFO L226 Difference]: Without dead ends: 150 [2025-01-09 15:39:15,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:39:15,036 INFO L435 NwaCegarLoop]: 222 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, 222 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 [2025-01-09 15:39:15,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:39:15,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-09 15:39:15,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-01-09 15:39:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 131 states have (on average 1.4351145038167938) internal successors, (188), 131 states have internal predecessors, (188), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:39:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2025-01-09 15:39:15,076 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 222 transitions. Word has length 153 [2025-01-09 15:39:15,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:39:15,076 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 222 transitions. [2025-01-09 15:39:15,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:39:15,077 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 222 transitions. [2025-01-09 15:39:15,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:39:15,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:39:15,080 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:39:15,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:39:15,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:39:15,281 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:39:15,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:39:15,282 INFO L85 PathProgramCache]: Analyzing trace with hash -570300096, now seen corresponding path program 1 times [2025-01-09 15:39:15,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:39:15,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993195144] [2025-01-09 15:39:15,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:39:15,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:39:15,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:39:15,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:39:15,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:39:15,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:39:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:39:15,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:39:15,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993195144] [2025-01-09 15:39:15,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993195144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:39:15,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:39:15,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:39:15,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295652095] [2025-01-09 15:39:15,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:39:15,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:39:15,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:39:15,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:39:15,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:39:15,773 INFO L87 Difference]: Start difference. First operand 150 states and 222 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:39:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:39:15,827 INFO L93 Difference]: Finished difference Result 299 states and 444 transitions. [2025-01-09 15:39:15,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:39:15,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 153 [2025-01-09 15:39:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:39:15,830 INFO L225 Difference]: With dead ends: 299 [2025-01-09 15:39:15,830 INFO L226 Difference]: Without dead ends: 152 [2025-01-09 15:39:15,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:39:15,831 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:39:15,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 649 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:39:15,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-09 15:39:15,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-01-09 15:39:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 133 states have (on average 1.4285714285714286) internal successors, (190), 133 states have internal predecessors, (190), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:39:15,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 224 transitions. [2025-01-09 15:39:15,856 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 224 transitions. Word has length 153 [2025-01-09 15:39:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:39:15,857 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 224 transitions. [2025-01-09 15:39:15,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:39:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 224 transitions. [2025-01-09 15:39:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:39:15,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:39:15,860 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:39:15,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:39:15,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:39:15,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:39:15,861 INFO L85 PathProgramCache]: Analyzing trace with hash -135794498, now seen corresponding path program 1 times [2025-01-09 15:39:15,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:39:15,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179231477] [2025-01-09 15:39:15,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:39:15,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:39:15,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:39:15,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:39:15,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:39:15,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:39:16,264 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 15:39:16,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:39:16,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179231477] [2025-01-09 15:39:16,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179231477] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:39:16,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603934541] [2025-01-09 15:39:16,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:39:16,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:39:16,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:39:16,270 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:39:16,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:39:16,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:39:16,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:39:16,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:39:16,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:39:16,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:39:16,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:39:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:39:16,659 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:39:16,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603934541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:39:16,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:39:16,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 15:39:16,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246533757] [2025-01-09 15:39:16,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:39:16,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:39:16,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:39:16,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:39:16,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:39:16,663 INFO L87 Difference]: Start difference. First operand 152 states and 224 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:39:16,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:39:16,703 INFO L93 Difference]: Finished difference Result 304 states and 449 transitions. [2025-01-09 15:39:16,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:39:16,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 153 [2025-01-09 15:39:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:39:16,708 INFO L225 Difference]: With dead ends: 304 [2025-01-09 15:39:16,710 INFO L226 Difference]: Without dead ends: 155 [2025-01-09 15:39:16,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:39:16,712 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 1 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:39:16,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 646 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:39:16,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-09 15:39:16,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2025-01-09 15:39:16,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 135 states have (on average 1.4222222222222223) internal successors, (192), 135 states have internal predecessors, (192), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:39:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 226 transitions. [2025-01-09 15:39:16,732 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 226 transitions. Word has length 153 [2025-01-09 15:39:16,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:39:16,734 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 226 transitions. [2025-01-09 15:39:16,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:39:16,734 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 226 transitions. [2025-01-09 15:39:16,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:39:16,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:39:16,740 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:39:16,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:39:16,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:39:16,941 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:39:16,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:39:16,941 INFO L85 PathProgramCache]: Analyzing trace with hash 544263872, now seen corresponding path program 1 times [2025-01-09 15:39:16,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:39:16,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549041806] [2025-01-09 15:39:16,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:39:16,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:39:16,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:39:17,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:39:17,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:39:17,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:39:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 15:39:17,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:39:17,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549041806] [2025-01-09 15:39:17,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549041806] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:39:17,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917378436] [2025-01-09 15:39:17,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:39:17,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:39:17,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:39:17,255 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:39:17,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 15:39:17,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:39:17,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:39:17,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:39:17,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:39:17,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:39:17,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:39:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:39:17,596 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:39:17,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917378436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:39:17,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:39:17,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 15:39:17,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650507982] [2025-01-09 15:39:17,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:39:17,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:39:17,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:39:17,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:39:17,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:39:17,598 INFO L87 Difference]: Start difference. First operand 154 states and 226 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:39:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:39:17,630 INFO L93 Difference]: Finished difference Result 308 states and 453 transitions. [2025-01-09 15:39:17,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:39:17,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 153 [2025-01-09 15:39:17,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:39:17,634 INFO L225 Difference]: With dead ends: 308 [2025-01-09 15:39:17,634 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 15:39:17,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:39:17,635 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:39:17,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 647 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:39:17,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 15:39:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2025-01-09 15:39:17,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 137 states have (on average 1.416058394160584) internal successors, (194), 137 states have internal predecessors, (194), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:39:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 228 transitions. [2025-01-09 15:39:17,655 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 228 transitions. Word has length 153 [2025-01-09 15:39:17,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:39:17,656 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 228 transitions. [2025-01-09 15:39:17,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:39:17,657 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 228 transitions. [2025-01-09 15:39:17,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:39:17,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:39:17,660 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:39:17,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 15:39:17,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:39:17,861 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:39:17,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:39:17,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1975696062, now seen corresponding path program 1 times [2025-01-09 15:39:17,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:39:17,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491552698] [2025-01-09 15:39:17,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:39:17,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:39:17,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:39:17,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:39:17,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:39:17,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:39:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 15:39:18,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:39:18,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491552698] [2025-01-09 15:39:18,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491552698] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:39:18,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931459334] [2025-01-09 15:39:18,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:39:18,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:39:18,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:39:18,157 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:39:18,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 15:39:18,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:39:18,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:39:18,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:39:18,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:39:18,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:39:18,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:39:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:39:18,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:39:18,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931459334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:39:18,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:39:18,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-01-09 15:39:18,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183515576] [2025-01-09 15:39:18,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:39:18,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:39:18,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:39:18,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:39:18,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:39:18,523 INFO L87 Difference]: Start difference. First operand 156 states and 228 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:39:18,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:39:18,556 INFO L93 Difference]: Finished difference Result 311 states and 456 transitions. [2025-01-09 15:39:18,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:39:18,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 153 [2025-01-09 15:39:18,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:39:18,561 INFO L225 Difference]: With dead ends: 311 [2025-01-09 15:39:18,561 INFO L226 Difference]: Without dead ends: 158 [2025-01-09 15:39:18,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:39:18,562 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:39:18,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 649 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:39:18,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-01-09 15:39:18,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-01-09 15:39:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 139 states have (on average 1.410071942446043) internal successors, (196), 139 states have internal predecessors, (196), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:39:18,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 230 transitions. [2025-01-09 15:39:18,578 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 230 transitions. Word has length 153 [2025-01-09 15:39:18,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:39:18,579 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 230 transitions. [2025-01-09 15:39:18,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:39:18,579 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 230 transitions. [2025-01-09 15:39:18,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:39:18,581 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:39:18,581 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:39:18,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 15:39:18,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:39:18,786 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:39:18,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:39:18,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1795662117, now seen corresponding path program 1 times [2025-01-09 15:39:18,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:39:18,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069888365] [2025-01-09 15:39:18,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:39:18,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:39:18,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:39:18,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:39:18,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:39:18,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:39:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:39:19,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:39:19,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069888365] [2025-01-09 15:39:19,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069888365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:39:19,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:39:19,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:39:19,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310169262] [2025-01-09 15:39:19,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:39:19,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:39:19,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:39:19,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:39:19,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:39:19,920 INFO L87 Difference]: Start difference. First operand 158 states and 230 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:39:20,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:39:20,190 INFO L93 Difference]: Finished difference Result 425 states and 619 transitions. [2025-01-09 15:39:20,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:39:20,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 155 [2025-01-09 15:39:20,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:39:20,197 INFO L225 Difference]: With dead ends: 425 [2025-01-09 15:39:20,197 INFO L226 Difference]: Without dead ends: 270 [2025-01-09 15:39:20,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:39:20,200 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 149 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:39:20,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1377 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:39:20,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-01-09 15:39:20,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2025-01-09 15:39:20,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 239 states have (on average 1.4184100418410042) internal successors, (339), 240 states have internal predecessors, (339), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 15:39:20,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 389 transitions. [2025-01-09 15:39:20,221 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 389 transitions. Word has length 155 [2025-01-09 15:39:20,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:39:20,222 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 389 transitions. [2025-01-09 15:39:20,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:39:20,222 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 389 transitions. [2025-01-09 15:39:20,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:39:20,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:39:20,224 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:39:20,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:39:20,224 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:39:20,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:39:20,226 INFO L85 PathProgramCache]: Analyzing trace with hash -978013667, now seen corresponding path program 1 times [2025-01-09 15:39:20,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:39:20,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890140582] [2025-01-09 15:39:20,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:39:20,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:39:20,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:39:20,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:39:20,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:39:20,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:39:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:39:20,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:39:20,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890140582] [2025-01-09 15:39:20,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890140582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:39:20,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:39:20,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:39:20,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316019056] [2025-01-09 15:39:20,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:39:20,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:39:20,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:39:20,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:39:20,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:39:20,730 INFO L87 Difference]: Start difference. First operand 267 states and 389 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:39:20,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:39:20,810 INFO L93 Difference]: Finished difference Result 532 states and 777 transitions. [2025-01-09 15:39:20,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:39:20,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 155 [2025-01-09 15:39:20,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:39:20,815 INFO L225 Difference]: With dead ends: 532 [2025-01-09 15:39:20,816 INFO L226 Difference]: Without dead ends: 268 [2025-01-09 15:39:20,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:39:20,818 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 2 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:39:20,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 848 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:39:20,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-01-09 15:39:20,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-01-09 15:39:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 240 states have (on average 1.4166666666666667) internal successors, (340), 241 states have internal predecessors, (340), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 15:39:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 390 transitions. [2025-01-09 15:39:20,840 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 390 transitions. Word has length 155 [2025-01-09 15:39:20,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:39:20,840 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 390 transitions. [2025-01-09 15:39:20,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:39:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 390 transitions. [2025-01-09 15:39:20,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:39:20,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:39:20,843 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:39:20,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:39:20,843 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:39:20,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:39:20,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1511515295, now seen corresponding path program 1 times [2025-01-09 15:39:20,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:39:20,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113527891] [2025-01-09 15:39:20,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:39:20,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:39:20,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:39:21,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:39:21,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:39:21,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:39:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:39:24,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:39:24,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113527891] [2025-01-09 15:39:24,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113527891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:39:24,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:39:24,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:39:24,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077316833] [2025-01-09 15:39:24,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:39:24,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:39:24,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:39:24,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:39:24,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:39:24,044 INFO L87 Difference]: Start difference. First operand 268 states and 390 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:39:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:39:24,595 INFO L93 Difference]: Finished difference Result 693 states and 1008 transitions. [2025-01-09 15:39:24,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:39:24,596 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 155 [2025-01-09 15:39:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:39:24,598 INFO L225 Difference]: With dead ends: 693 [2025-01-09 15:39:24,598 INFO L226 Difference]: Without dead ends: 428 [2025-01-09 15:39:24,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:39:24,600 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 145 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:39:24,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1124 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:39:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-01-09 15:39:24,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 272. [2025-01-09 15:39:24,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 244 states have (on average 1.4098360655737705) internal successors, (344), 245 states have internal predecessors, (344), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 15:39:24,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 394 transitions. [2025-01-09 15:39:24,622 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 394 transitions. Word has length 155 [2025-01-09 15:39:24,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:39:24,624 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 394 transitions. [2025-01-09 15:39:24,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:39:24,624 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 394 transitions. [2025-01-09 15:39:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:39:24,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:39:24,626 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:39:24,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:39:24,626 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:39:24,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:39:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash -482629411, now seen corresponding path program 1 times [2025-01-09 15:39:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:39:24,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433626381] [2025-01-09 15:39:24,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:39:24,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:39:24,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:39:24,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:39:24,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:39:24,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat