./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-18.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-a_file-18.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 34c00af4b4663198525b0b7086d994deb20901b2017b1e6c2fe4ceb71d985d42 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:18:45,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:18:45,156 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:18:45,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:18:45,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:18:45,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:18:45,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:18:45,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:18:45,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:18:45,190 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:18:45,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:18:45,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:18:45,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:18:45,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:18:45,191 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:18:45,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:18:45,191 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:18:45,191 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:18:45,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:18:45,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:18:45,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:18:45,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:18:45,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:18:45,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:18:45,192 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:18:45,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:18:45,192 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:18:45,192 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:18:45,192 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:18:45,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:18:45,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:18:45,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:18:45,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:18:45,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:18:45,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:18:45,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:18:45,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:18:45,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:18:45,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:18:45,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:18:45,194 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:18:45,194 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:18:45,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:18:45,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:18:45,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:18:45,194 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:18:45,194 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:18:45,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:18:45,194 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 -> 34c00af4b4663198525b0b7086d994deb20901b2017b1e6c2fe4ceb71d985d42 [2025-01-09 15:18:45,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:18:45,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:18:45,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:18:45,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:18:45,438 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:18:45,438 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-a_file-18.i [2025-01-09 15:18:46,663 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea10bef49/1d37b74d0cac4300adf07fef9ead1250/FLAG2ee2e51c7 [2025-01-09 15:18:46,947 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:18:46,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-18.i [2025-01-09 15:18:46,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea10bef49/1d37b74d0cac4300adf07fef9ead1250/FLAG2ee2e51c7 [2025-01-09 15:18:46,980 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea10bef49/1d37b74d0cac4300adf07fef9ead1250 [2025-01-09 15:18:46,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:18:46,983 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:18:46,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:18:46,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:18:46,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:18:46,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:18:46" (1/1) ... [2025-01-09 15:18:46,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a07bb2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:46, skipping insertion in model container [2025-01-09 15:18:46,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:18:46" (1/1) ... [2025-01-09 15:18:47,000 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:18:47,093 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-a_file-18.i[916,929] [2025-01-09 15:18:47,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:18:47,141 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:18:47,148 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-a_file-18.i[916,929] [2025-01-09 15:18:47,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:18:47,199 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:18:47,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:47 WrapperNode [2025-01-09 15:18:47,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:18:47,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:18:47,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:18:47,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:18:47,205 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:18:47" (1/1) ... [2025-01-09 15:18:47,215 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:18:47" (1/1) ... [2025-01-09 15:18:47,259 INFO L138 Inliner]: procedures = 29, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 478 [2025-01-09 15:18:47,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:18:47,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:18:47,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:18:47,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:18:47,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:47" (1/1) ... [2025-01-09 15:18:47,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:47" (1/1) ... [2025-01-09 15:18:47,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:47" (1/1) ... [2025-01-09 15:18:47,291 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 6, 29, 22, 46, 10]. 40 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 2, 3, 1]. The 13 writes are split as follows [0, 1, 4, 2, 4, 2]. [2025-01-09 15:18:47,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:47" (1/1) ... [2025-01-09 15:18:47,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:47" (1/1) ... [2025-01-09 15:18:47,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:47" (1/1) ... [2025-01-09 15:18:47,304 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:47" (1/1) ... [2025-01-09 15:18:47,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:47" (1/1) ... [2025-01-09 15:18:47,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:47" (1/1) ... [2025-01-09 15:18:47,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:47" (1/1) ... [2025-01-09 15:18:47,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:18:47,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:18:47,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:18:47,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:18:47,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:47" (1/1) ... [2025-01-09 15:18:47,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:18:47,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:18:47,337 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:18:47,346 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:18:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:18:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:18:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:18:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:18:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:18:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:18:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:18:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:18:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:18:47,360 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:18:47,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:18:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:18:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:18:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:18:47,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:18:47,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:18:47,451 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:18:47,453 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:18:47,818 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2025-01-09 15:18:47,818 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:18:47,828 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:18:47,830 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:18:47,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:18:47 BoogieIcfgContainer [2025-01-09 15:18:47,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:18:47,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:18:47,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:18:47,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:18:47,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:18:46" (1/3) ... [2025-01-09 15:18:47,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f59737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:18:47, skipping insertion in model container [2025-01-09 15:18:47,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:18:47" (2/3) ... [2025-01-09 15:18:47,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f59737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:18:47, skipping insertion in model container [2025-01-09 15:18:47,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:18:47" (3/3) ... [2025-01-09 15:18:47,836 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-18.i [2025-01-09 15:18:47,846 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:18:47,847 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-18.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:18:47,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:18:47,911 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;@5a9a0e66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:18:47,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:18:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:18:47,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 15:18:47,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:18:47,933 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:47,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:18:47,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:18:47,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1299494504, now seen corresponding path program 1 times [2025-01-09 15:18:47,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:18:47,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736815735] [2025-01-09 15:18:47,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:47,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:18:48,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 15:18:48,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 15:18:48,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:18:48,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:18:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 15:18:48,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:18:48,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736815735] [2025-01-09 15:18:48,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736815735] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:18:48,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862937010] [2025-01-09 15:18:48,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:48,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:18:48,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:18:48,178 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:18:48,180 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:18:48,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 15:18:48,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 15:18:48,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:18:48,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:18:48,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:18:48,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:18:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 15:18:48,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:18:48,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862937010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:18:48,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:18:48,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:18:48,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082949519] [2025-01-09 15:18:48,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:18:48,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:18:48,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:18:48,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:18:48,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:18:48,453 INFO L87 Difference]: Start difference. First operand has 107 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:18:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:18:48,470 INFO L93 Difference]: Finished difference Result 208 states and 323 transitions. [2025-01-09 15:18:48,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:18:48,472 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2025-01-09 15:18:48,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:18:48,476 INFO L225 Difference]: With dead ends: 208 [2025-01-09 15:18:48,476 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 15:18:48,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 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:18:48,480 INFO L435 NwaCegarLoop]: 153 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, 153 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:18:48,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:18:48,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 15:18:48,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-01-09 15:18:48,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:18:48,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 153 transitions. [2025-01-09 15:18:48,509 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 153 transitions. Word has length 107 [2025-01-09 15:18:48,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:18:48,509 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 153 transitions. [2025-01-09 15:18:48,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:18:48,509 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 153 transitions. [2025-01-09 15:18:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 15:18:48,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:18:48,511 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:48,518 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:18:48,712 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:18:48,712 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:18:48,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:18:48,713 INFO L85 PathProgramCache]: Analyzing trace with hash 407316292, now seen corresponding path program 1 times [2025-01-09 15:18:48,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:18:48,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621891582] [2025-01-09 15:18:48,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:48,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:18:48,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 15:18:48,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 15:18:48,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:18:48,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:18:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:18:48,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:18:49,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621891582] [2025-01-09 15:18:49,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621891582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:18:49,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:18:49,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:18:49,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958175564] [2025-01-09 15:18:49,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:18:49,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:18:49,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:18:49,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:18:49,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:18:49,001 INFO L87 Difference]: Start difference. First operand 104 states and 153 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:18:49,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:18:49,029 INFO L93 Difference]: Finished difference Result 207 states and 306 transitions. [2025-01-09 15:18:49,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:18:49,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2025-01-09 15:18:49,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:18:49,034 INFO L225 Difference]: With dead ends: 207 [2025-01-09 15:18:49,034 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 15:18:49,034 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:18:49,035 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 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:18:49,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:18:49,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 15:18:49,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-01-09 15:18:49,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:18:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2025-01-09 15:18:49,048 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 107 [2025-01-09 15:18:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:18:49,049 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2025-01-09 15:18:49,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:18:49,051 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2025-01-09 15:18:49,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 15:18:49,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:18:49,054 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:49,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:18:49,055 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:18:49,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:18:49,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1465154370, now seen corresponding path program 1 times [2025-01-09 15:18:49,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:18:49,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845724614] [2025-01-09 15:18:49,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:49,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:18:49,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 15:18:49,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 15:18:49,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:18:49,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:18:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:18:49,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:18:49,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845724614] [2025-01-09 15:18:49,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845724614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:18:49,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:18:49,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:18:49,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965861437] [2025-01-09 15:18:49,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:18:49,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:18:49,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:18:49,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:18:49,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:18:49,592 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:18:49,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:18:49,765 INFO L93 Difference]: Finished difference Result 312 states and 459 transitions. [2025-01-09 15:18:49,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:18:49,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-01-09 15:18:49,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:18:49,768 INFO L225 Difference]: With dead ends: 312 [2025-01-09 15:18:49,769 INFO L226 Difference]: Without dead ends: 209 [2025-01-09 15:18:49,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:18:49,771 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 113 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:18:49,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 446 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:18:49,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-09 15:18:49,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 204. [2025-01-09 15:18:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 177 states have (on average 1.423728813559322) internal successors, (252), 177 states have internal predecessors, (252), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:18:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 300 transitions. [2025-01-09 15:18:49,787 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 300 transitions. Word has length 107 [2025-01-09 15:18:49,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:18:49,787 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 300 transitions. [2025-01-09 15:18:49,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:18:49,787 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 300 transitions. [2025-01-09 15:18:49,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:18:49,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:18:49,788 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:49,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:18:49,789 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:18:49,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:18:49,789 INFO L85 PathProgramCache]: Analyzing trace with hash 452784968, now seen corresponding path program 1 times [2025-01-09 15:18:49,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:18:49,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207090104] [2025-01-09 15:18:49,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:49,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:18:49,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:18:49,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:18:49,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:18:49,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:18:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:18:50,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:18:50,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207090104] [2025-01-09 15:18:50,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207090104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:18:50,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:18:50,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:18:50,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724560810] [2025-01-09 15:18:50,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:18:50,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:18:50,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:18:50,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:18:50,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:18:50,153 INFO L87 Difference]: Start difference. First operand 204 states and 300 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:18:50,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:18:50,320 INFO L93 Difference]: Finished difference Result 410 states and 603 transitions. [2025-01-09 15:18:50,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:18:50,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-01-09 15:18:50,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:18:50,322 INFO L225 Difference]: With dead ends: 410 [2025-01-09 15:18:50,322 INFO L226 Difference]: Without dead ends: 209 [2025-01-09 15:18:50,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:18:50,323 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 106 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:18:50,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 567 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:18:50,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-09 15:18:50,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 204. [2025-01-09 15:18:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 177 states have (on average 1.4180790960451977) internal successors, (251), 177 states have internal predecessors, (251), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:18:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 299 transitions. [2025-01-09 15:18:50,335 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 299 transitions. Word has length 108 [2025-01-09 15:18:50,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:18:50,335 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 299 transitions. [2025-01-09 15:18:50,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:18:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 299 transitions. [2025-01-09 15:18:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:18:50,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:18:50,336 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:50,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:18:50,337 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:18:50,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:18:50,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1703877766, now seen corresponding path program 1 times [2025-01-09 15:18:50,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:18:50,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100268549] [2025-01-09 15:18:50,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:50,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:18:50,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:18:50,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:18:50,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:18:50,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:18:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:18:50,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:18:50,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100268549] [2025-01-09 15:18:50,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100268549] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:18:50,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:18:50,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:18:50,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014526970] [2025-01-09 15:18:50,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:18:50,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:18:50,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:18:50,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:18:50,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:18:50,616 INFO L87 Difference]: Start difference. First operand 204 states and 299 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:18:50,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:18:50,688 INFO L93 Difference]: Finished difference Result 309 states and 454 transitions. [2025-01-09 15:18:50,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:18:50,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-01-09 15:18:50,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:18:50,689 INFO L225 Difference]: With dead ends: 309 [2025-01-09 15:18:50,689 INFO L226 Difference]: Without dead ends: 206 [2025-01-09 15:18:50,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:18:50,690 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 5 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:18:50,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 524 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:18:50,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-01-09 15:18:50,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2025-01-09 15:18:50,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 178 states have (on average 1.4157303370786516) internal successors, (252), 178 states have internal predecessors, (252), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:18:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 300 transitions. [2025-01-09 15:18:50,717 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 300 transitions. Word has length 108 [2025-01-09 15:18:50,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:18:50,717 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 300 transitions. [2025-01-09 15:18:50,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:18:50,717 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 300 transitions. [2025-01-09 15:18:50,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:18:50,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:18:50,718 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:50,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:18:50,718 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:18:50,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:18:50,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1002741628, now seen corresponding path program 1 times [2025-01-09 15:18:50,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:18:50,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759664115] [2025-01-09 15:18:50,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:50,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:18:50,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:18:50,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:18:50,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:18:50,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:18:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:18:51,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:18:51,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759664115] [2025-01-09 15:18:51,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759664115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:18:51,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:18:51,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:18:51,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256713323] [2025-01-09 15:18:51,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:18:51,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:18:51,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:18:51,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:18:51,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:18:51,550 INFO L87 Difference]: Start difference. First operand 205 states and 300 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:18:52,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:18:52,881 INFO L93 Difference]: Finished difference Result 425 states and 625 transitions. [2025-01-09 15:18:52,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:18:52,885 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2025-01-09 15:18:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:18:52,886 INFO L225 Difference]: With dead ends: 425 [2025-01-09 15:18:52,886 INFO L226 Difference]: Without dead ends: 321 [2025-01-09 15:18:52,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2025-01-09 15:18:52,887 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 452 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:18:52,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1179 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 15:18:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-01-09 15:18:52,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 304. [2025-01-09 15:18:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 264 states have (on average 1.4166666666666667) internal successors, (374), 264 states have internal predecessors, (374), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:18:52,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 446 transitions. [2025-01-09 15:18:52,925 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 446 transitions. Word has length 108 [2025-01-09 15:18:52,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:18:52,926 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 446 transitions. [2025-01-09 15:18:52,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:18:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 446 transitions. [2025-01-09 15:18:52,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:18:52,926 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:18:52,927 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:52,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:18:52,927 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:18:52,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:18:52,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1260907066, now seen corresponding path program 1 times [2025-01-09 15:18:52,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:18:52,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483113943] [2025-01-09 15:18:52,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:52,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:18:52,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:18:53,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:18:53,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:18:53,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:18:53,408 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 15:18:53,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:18:53,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483113943] [2025-01-09 15:18:53,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483113943] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:18:53,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394998831] [2025-01-09 15:18:53,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:53,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:18:53,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:18:53,410 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:18:53,412 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:18:53,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:18:53,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:18:53,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:18:53,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:18:53,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 15:18:53,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:18:53,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 15:18:53,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 18 [2025-01-09 15:18:53,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:18:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 15:18:53,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:18:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 15:18:54,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394998831] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:18:54,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:18:54,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 26 [2025-01-09 15:18:54,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626317185] [2025-01-09 15:18:54,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:18:54,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 15:18:54,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:18:54,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 15:18:54,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:18:54,182 INFO L87 Difference]: Start difference. First operand 304 states and 446 transitions. Second operand has 26 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 25 states have internal predecessors, (88), 6 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 6 states have call successors, (24) [2025-01-09 15:18:55,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:18:55,156 INFO L93 Difference]: Finished difference Result 954 states and 1382 transitions. [2025-01-09 15:18:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 15:18:55,157 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 25 states have internal predecessors, (88), 6 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 6 states have call successors, (24) Word has length 108 [2025-01-09 15:18:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:18:55,160 INFO L225 Difference]: With dead ends: 954 [2025-01-09 15:18:55,160 INFO L226 Difference]: Without dead ends: 653 [2025-01-09 15:18:55,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=432, Invalid=2118, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 15:18:55,164 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1174 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:18:55,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 1901 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:18:55,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-01-09 15:18:55,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 636. [2025-01-09 15:18:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 551 states have (on average 1.382940108892922) internal successors, (762), 551 states have internal predecessors, (762), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 15:18:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 906 transitions. [2025-01-09 15:18:55,210 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 906 transitions. Word has length 108 [2025-01-09 15:18:55,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:18:55,211 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 906 transitions. [2025-01-09 15:18:55,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 25 states have internal predecessors, (88), 6 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 6 states have call successors, (24) [2025-01-09 15:18:55,211 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 906 transitions. [2025-01-09 15:18:55,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:18:55,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:18:55,212 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:55,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 15:18:55,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:18:55,414 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:18:55,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:18:55,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1783394726, now seen corresponding path program 1 times [2025-01-09 15:18:55,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:18:55,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611521707] [2025-01-09 15:18:55,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:55,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:18:55,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:18:55,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:18:55,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:18:55,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:18:56,626 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:18:56,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:18:56,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611521707] [2025-01-09 15:18:56,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611521707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:18:56,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:18:56,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:18:56,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659489845] [2025-01-09 15:18:56,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:18:56,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:18:56,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:18:56,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:18:56,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:18:56,628 INFO L87 Difference]: Start difference. First operand 636 states and 906 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:18:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:18:58,789 INFO L93 Difference]: Finished difference Result 2160 states and 3083 transitions. [2025-01-09 15:18:58,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 15:18:58,789 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-01-09 15:18:58,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:18:58,796 INFO L225 Difference]: With dead ends: 2160 [2025-01-09 15:18:58,796 INFO L226 Difference]: Without dead ends: 1949 [2025-01-09 15:18:58,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2025-01-09 15:18:58,797 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 1326 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:18:58,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 1090 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 15:18:58,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2025-01-09 15:18:58,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1511. [2025-01-09 15:18:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1342 states have (on average 1.397913561847988) internal successors, (1876), 1350 states have internal predecessors, (1876), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 136 states have call predecessors, (144), 144 states have call successors, (144) [2025-01-09 15:18:58,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2164 transitions. [2025-01-09 15:18:58,899 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2164 transitions. Word has length 109 [2025-01-09 15:18:58,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:18:58,899 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 2164 transitions. [2025-01-09 15:18:58,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:18:58,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2164 transitions. [2025-01-09 15:18:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:18:58,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:18:58,901 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:58,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:18:58,901 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:18:58,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:18:58,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1676050392, now seen corresponding path program 1 times [2025-01-09 15:18:58,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:18:58,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527476642] [2025-01-09 15:18:58,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:58,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:18:58,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:18:58,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:18:58,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:18:58,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:18:59,115 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:18:59,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:18:59,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527476642] [2025-01-09 15:18:59,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527476642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:18:59,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:18:59,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:18:59,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776401438] [2025-01-09 15:18:59,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:18:59,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:18:59,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:18:59,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:18:59,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:18:59,117 INFO L87 Difference]: Start difference. First operand 1511 states and 2164 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:18:59,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:18:59,464 INFO L93 Difference]: Finished difference Result 2806 states and 4006 transitions. [2025-01-09 15:18:59,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:18:59,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-01-09 15:18:59,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:18:59,475 INFO L225 Difference]: With dead ends: 2806 [2025-01-09 15:18:59,475 INFO L226 Difference]: Without dead ends: 1666 [2025-01-09 15:18:59,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:18:59,481 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 241 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:18:59,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 659 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:18:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2025-01-09 15:18:59,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1658. [2025-01-09 15:18:59,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1459 states have (on average 1.3776559287183001) internal successors, (2010), 1467 states have internal predecessors, (2010), 168 states have call successors, (168), 30 states have call predecessors, (168), 30 states have return successors, (168), 160 states have call predecessors, (168), 168 states have call successors, (168) [2025-01-09 15:18:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2346 transitions. [2025-01-09 15:18:59,581 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2346 transitions. Word has length 110 [2025-01-09 15:18:59,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:18:59,581 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2346 transitions. [2025-01-09 15:18:59,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:18:59,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2346 transitions. [2025-01-09 15:18:59,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:18:59,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:18:59,584 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:59,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:18:59,586 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:18:59,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:18:59,587 INFO L85 PathProgramCache]: Analyzing trace with hash 375430312, now seen corresponding path program 1 times [2025-01-09 15:18:59,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:18:59,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603464043] [2025-01-09 15:18:59,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:18:59,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:18:59,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:18:59,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:18:59,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:18:59,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:18:59,727 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:18:59,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:18:59,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603464043] [2025-01-09 15:18:59,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603464043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:18:59,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:18:59,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:18:59,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850378863] [2025-01-09 15:18:59,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:18:59,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:18:59,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:18:59,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:18:59,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:18:59,729 INFO L87 Difference]: Start difference. First operand 1658 states and 2346 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:18:59,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:18:59,971 INFO L93 Difference]: Finished difference Result 3094 states and 4365 transitions. [2025-01-09 15:18:59,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:18:59,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-01-09 15:18:59,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:18:59,980 INFO L225 Difference]: With dead ends: 3094 [2025-01-09 15:18:59,980 INFO L226 Difference]: Without dead ends: 1807 [2025-01-09 15:18:59,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:18:59,982 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 149 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:18:59,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 483 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:18:59,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2025-01-09 15:19:00,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1799. [2025-01-09 15:19:00,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1573 states have (on average 1.371900826446281) internal successors, (2158), 1578 states have internal predecessors, (2158), 186 states have call successors, (186), 39 states have call predecessors, (186), 39 states have return successors, (186), 181 states have call predecessors, (186), 186 states have call successors, (186) [2025-01-09 15:19:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2530 transitions. [2025-01-09 15:19:00,086 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2530 transitions. Word has length 110 [2025-01-09 15:19:00,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:00,087 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2530 transitions. [2025-01-09 15:19:00,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2530 transitions. [2025-01-09 15:19:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 15:19:00,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:00,089 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:00,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:19:00,089 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:00,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:00,090 INFO L85 PathProgramCache]: Analyzing trace with hash -467318485, now seen corresponding path program 1 times [2025-01-09 15:19:00,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:00,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221330119] [2025-01-09 15:19:00,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:00,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:00,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:19:00,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:19:00,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:00,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:00,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:00,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221330119] [2025-01-09 15:19:00,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221330119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:00,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:00,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:19:00,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301617813] [2025-01-09 15:19:00,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:00,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:19:00,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:00,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:19:00,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:19:00,491 INFO L87 Difference]: Start difference. First operand 1799 states and 2530 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:00,881 INFO L93 Difference]: Finished difference Result 3050 states and 4272 transitions. [2025-01-09 15:19:00,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:19:00,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-01-09 15:19:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:00,889 INFO L225 Difference]: With dead ends: 3050 [2025-01-09 15:19:00,889 INFO L226 Difference]: Without dead ends: 1840 [2025-01-09 15:19:00,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:19:00,893 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 294 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:00,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 924 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:19:00,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2025-01-09 15:19:01,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1799. [2025-01-09 15:19:01,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1573 states have (on average 1.3693579148124602) internal successors, (2154), 1578 states have internal predecessors, (2154), 186 states have call successors, (186), 39 states have call predecessors, (186), 39 states have return successors, (186), 181 states have call predecessors, (186), 186 states have call successors, (186) [2025-01-09 15:19:01,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2526 transitions. [2025-01-09 15:19:01,042 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2526 transitions. Word has length 111 [2025-01-09 15:19:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:01,044 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2526 transitions. [2025-01-09 15:19:01,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2526 transitions. [2025-01-09 15:19:01,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 15:19:01,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:01,046 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:01,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:19:01,046 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:01,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:01,046 INFO L85 PathProgramCache]: Analyzing trace with hash -368188320, now seen corresponding path program 1 times [2025-01-09 15:19:01,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:01,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32867967] [2025-01-09 15:19:01,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:01,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:01,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:19:01,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:19:01,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:01,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:01,142 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:01,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:01,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32867967] [2025-01-09 15:19:01,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32867967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:01,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:01,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:19:01,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16562725] [2025-01-09 15:19:01,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:01,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:19:01,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:01,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:19:01,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:19:01,144 INFO L87 Difference]: Start difference. First operand 1799 states and 2526 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:01,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:01,259 INFO L93 Difference]: Finished difference Result 3579 states and 5020 transitions. [2025-01-09 15:19:01,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:19:01,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-01-09 15:19:01,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:01,266 INFO L225 Difference]: With dead ends: 3579 [2025-01-09 15:19:01,266 INFO L226 Difference]: Without dead ends: 1783 [2025-01-09 15:19:01,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:19:01,269 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 105 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:01,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 552 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:19:01,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2025-01-09 15:19:01,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1209. [2025-01-09 15:19:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1055 states have (on average 1.3582938388625592) internal successors, (1433), 1058 states have internal predecessors, (1433), 126 states have call successors, (126), 27 states have call predecessors, (126), 27 states have return successors, (126), 123 states have call predecessors, (126), 126 states have call successors, (126) [2025-01-09 15:19:01,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1685 transitions. [2025-01-09 15:19:01,365 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1685 transitions. Word has length 111 [2025-01-09 15:19:01,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:01,366 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1685 transitions. [2025-01-09 15:19:01,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1685 transitions. [2025-01-09 15:19:01,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 15:19:01,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:01,367 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:01,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:19:01,367 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:01,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:01,368 INFO L85 PathProgramCache]: Analyzing trace with hash -968912789, now seen corresponding path program 1 times [2025-01-09 15:19:01,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:01,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972897750] [2025-01-09 15:19:01,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:01,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:01,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:19:01,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:19:01,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:01,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:02,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:02,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972897750] [2025-01-09 15:19:02,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972897750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:02,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:02,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:19:02,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260672555] [2025-01-09 15:19:02,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:02,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:19:02,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:02,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:19:02,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:19:02,152 INFO L87 Difference]: Start difference. First operand 1209 states and 1685 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:03,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:03,851 INFO L93 Difference]: Finished difference Result 3136 states and 4372 transitions. [2025-01-09 15:19:03,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 15:19:03,852 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-01-09 15:19:03,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:03,858 INFO L225 Difference]: With dead ends: 3136 [2025-01-09 15:19:03,858 INFO L226 Difference]: Without dead ends: 2111 [2025-01-09 15:19:03,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2025-01-09 15:19:03,860 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 350 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:03,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1809 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 15:19:03,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2025-01-09 15:19:03,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 990. [2025-01-09 15:19:03,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 854 states have (on average 1.3466042154566744) internal successors, (1150), 854 states have internal predecessors, (1150), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 15:19:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1366 transitions. [2025-01-09 15:19:03,935 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1366 transitions. Word has length 111 [2025-01-09 15:19:03,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:03,935 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1366 transitions. [2025-01-09 15:19:03,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:03,936 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1366 transitions. [2025-01-09 15:19:03,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 15:19:03,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:03,937 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:03,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:19:03,937 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:03,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:03,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1143523720, now seen corresponding path program 1 times [2025-01-09 15:19:03,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:03,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675571653] [2025-01-09 15:19:03,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:03,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:03,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:19:03,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:19:03,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:03,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:04,029 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 15:19:04,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:04,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675571653] [2025-01-09 15:19:04,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675571653] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:19:04,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422904136] [2025-01-09 15:19:04,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:04,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:19:04,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:19:04,031 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:19:04,033 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:19:04,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:19:04,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:19:04,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:04,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:04,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:19:04,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:04,197 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:19:04,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422904136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:04,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:19:04,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-01-09 15:19:04,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993545119] [2025-01-09 15:19:04,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:04,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:19:04,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:04,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:19:04,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:19:04,199 INFO L87 Difference]: Start difference. First operand 990 states and 1366 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:04,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:04,267 INFO L93 Difference]: Finished difference Result 2004 states and 2765 transitions. [2025-01-09 15:19:04,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:19:04,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-01-09 15:19:04,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:04,277 INFO L225 Difference]: With dead ends: 2004 [2025-01-09 15:19:04,277 INFO L226 Difference]: Without dead ends: 1017 [2025-01-09 15:19:04,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:19:04,279 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:04,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 573 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:19:04,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2025-01-09 15:19:04,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1017. [2025-01-09 15:19:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 881 states have (on average 1.3359818388195233) internal successors, (1177), 881 states have internal predecessors, (1177), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 15:19:04,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1393 transitions. [2025-01-09 15:19:04,349 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1393 transitions. Word has length 111 [2025-01-09 15:19:04,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:04,350 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1393 transitions. [2025-01-09 15:19:04,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:04,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1393 transitions. [2025-01-09 15:19:04,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 15:19:04,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:04,351 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:04,360 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:19:04,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:19:04,552 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:04,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:04,553 INFO L85 PathProgramCache]: Analyzing trace with hash 2109081867, now seen corresponding path program 1 times [2025-01-09 15:19:04,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:04,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021525874] [2025-01-09 15:19:04,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:04,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:04,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:19:04,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:19:04,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:04,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:04,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:04,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021525874] [2025-01-09 15:19:04,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021525874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:04,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:04,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:19:04,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529143488] [2025-01-09 15:19:04,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:04,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:19:04,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:04,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:19:04,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:19:04,822 INFO L87 Difference]: Start difference. First operand 1017 states and 1393 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:05,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:05,184 INFO L93 Difference]: Finished difference Result 1745 states and 2393 transitions. [2025-01-09 15:19:05,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:19:05,185 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-01-09 15:19:05,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:05,188 INFO L225 Difference]: With dead ends: 1745 [2025-01-09 15:19:05,188 INFO L226 Difference]: Without dead ends: 803 [2025-01-09 15:19:05,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:19:05,190 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 145 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:05,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 786 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:19:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-01-09 15:19:05,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 444. [2025-01-09 15:19:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 383 states have (on average 1.3237597911227155) internal successors, (507), 383 states have internal predecessors, (507), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 15:19:05,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 603 transitions. [2025-01-09 15:19:05,225 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 603 transitions. Word has length 111 [2025-01-09 15:19:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:05,225 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 603 transitions. [2025-01-09 15:19:05,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 603 transitions. [2025-01-09 15:19:05,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 15:19:05,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:05,226 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:05,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:19:05,226 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:05,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:05,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1673424180, now seen corresponding path program 1 times [2025-01-09 15:19:05,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:05,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021133233] [2025-01-09 15:19:05,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:05,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:05,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:19:05,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:19:05,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:05,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:05,314 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:05,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:05,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021133233] [2025-01-09 15:19:05,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021133233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:05,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:05,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:19:05,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200133613] [2025-01-09 15:19:05,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:05,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:19:05,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:05,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:19:05,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:19:05,316 INFO L87 Difference]: Start difference. First operand 444 states and 603 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:05,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:05,423 INFO L93 Difference]: Finished difference Result 1230 states and 1676 transitions. [2025-01-09 15:19:05,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:19:05,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-01-09 15:19:05,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:05,426 INFO L225 Difference]: With dead ends: 1230 [2025-01-09 15:19:05,426 INFO L226 Difference]: Without dead ends: 789 [2025-01-09 15:19:05,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:19:05,428 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 102 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:05,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 730 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:19:05,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-01-09 15:19:05,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 785. [2025-01-09 15:19:05,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 679 states have (on average 1.3254786450662739) internal successors, (900), 679 states have internal predecessors, (900), 84 states have call successors, (84), 21 states have call predecessors, (84), 21 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 15:19:05,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1068 transitions. [2025-01-09 15:19:05,486 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1068 transitions. Word has length 111 [2025-01-09 15:19:05,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:05,486 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1068 transitions. [2025-01-09 15:19:05,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:05,486 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1068 transitions. [2025-01-09 15:19:05,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:19:05,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:05,487 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:05,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:19:05,487 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:05,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:05,488 INFO L85 PathProgramCache]: Analyzing trace with hash -823674791, now seen corresponding path program 1 times [2025-01-09 15:19:05,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:05,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741689680] [2025-01-09 15:19:05,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:05,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:05,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:19:05,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:19:05,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:05,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:05,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:05,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741689680] [2025-01-09 15:19:05,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741689680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:05,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:05,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:19:05,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678997569] [2025-01-09 15:19:05,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:05,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:19:05,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:05,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:19:05,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:19:05,772 INFO L87 Difference]: Start difference. First operand 785 states and 1068 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:06,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:06,091 INFO L93 Difference]: Finished difference Result 1574 states and 2141 transitions. [2025-01-09 15:19:06,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:19:06,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2025-01-09 15:19:06,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:06,094 INFO L225 Difference]: With dead ends: 1574 [2025-01-09 15:19:06,094 INFO L226 Difference]: Without dead ends: 792 [2025-01-09 15:19:06,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:19:06,096 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 201 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:06,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 710 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:19:06,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-01-09 15:19:06,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 782. [2025-01-09 15:19:06,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 676 states have (on average 1.3210059171597632) internal successors, (893), 676 states have internal predecessors, (893), 84 states have call successors, (84), 21 states have call predecessors, (84), 21 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 15:19:06,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1061 transitions. [2025-01-09 15:19:06,158 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1061 transitions. Word has length 112 [2025-01-09 15:19:06,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:06,158 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 1061 transitions. [2025-01-09 15:19:06,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:06,158 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1061 transitions. [2025-01-09 15:19:06,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:19:06,159 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:06,160 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:06,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:19:06,160 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:06,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:06,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1410480805, now seen corresponding path program 1 times [2025-01-09 15:19:06,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:06,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398952868] [2025-01-09 15:19:06,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:06,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:06,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:19:06,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:19:06,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:06,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:06,484 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:06,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:06,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398952868] [2025-01-09 15:19:06,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398952868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:06,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:06,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:19:06,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626767358] [2025-01-09 15:19:06,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:06,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:19:06,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:06,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:19:06,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:19:06,486 INFO L87 Difference]: Start difference. First operand 782 states and 1061 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:06,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:06,950 INFO L93 Difference]: Finished difference Result 2073 states and 2834 transitions. [2025-01-09 15:19:06,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:19:06,950 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2025-01-09 15:19:06,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:06,956 INFO L225 Difference]: With dead ends: 2073 [2025-01-09 15:19:06,956 INFO L226 Difference]: Without dead ends: 1632 [2025-01-09 15:19:06,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:19:06,957 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 445 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:06,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1536 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:19:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2025-01-09 15:19:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1143. [2025-01-09 15:19:07,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 992 states have (on average 1.3336693548387097) internal successors, (1323), 992 states have internal predecessors, (1323), 120 states have call successors, (120), 30 states have call predecessors, (120), 30 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-01-09 15:19:07,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1563 transitions. [2025-01-09 15:19:07,066 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1563 transitions. Word has length 112 [2025-01-09 15:19:07,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:07,066 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1563 transitions. [2025-01-09 15:19:07,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1563 transitions. [2025-01-09 15:19:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:19:07,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:07,069 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:07,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:19:07,069 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:07,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:07,070 INFO L85 PathProgramCache]: Analyzing trace with hash -169683613, now seen corresponding path program 1 times [2025-01-09 15:19:07,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:07,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539091031] [2025-01-09 15:19:07,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:07,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:07,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:19:07,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:19:07,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:07,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:07,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:07,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539091031] [2025-01-09 15:19:07,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539091031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:07,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:07,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:19:07,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602199465] [2025-01-09 15:19:07,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:07,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:19:07,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:07,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:19:07,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:19:07,502 INFO L87 Difference]: Start difference. First operand 1143 states and 1563 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:08,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:08,098 INFO L93 Difference]: Finished difference Result 2205 states and 3020 transitions. [2025-01-09 15:19:08,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:19:08,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2025-01-09 15:19:08,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:08,103 INFO L225 Difference]: With dead ends: 2205 [2025-01-09 15:19:08,103 INFO L226 Difference]: Without dead ends: 1641 [2025-01-09 15:19:08,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:19:08,104 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 312 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:08,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1260 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:19:08,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2025-01-09 15:19:08,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1152. [2025-01-09 15:19:08,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1001 states have (on average 1.3326673326673326) internal successors, (1334), 1001 states have internal predecessors, (1334), 120 states have call successors, (120), 30 states have call predecessors, (120), 30 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-01-09 15:19:08,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1574 transitions. [2025-01-09 15:19:08,190 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1574 transitions. Word has length 112 [2025-01-09 15:19:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:08,191 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1574 transitions. [2025-01-09 15:19:08,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:08,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1574 transitions. [2025-01-09 15:19:08,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 15:19:08,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:08,192 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:08,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:19:08,192 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:08,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:08,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1998201048, now seen corresponding path program 1 times [2025-01-09 15:19:08,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:08,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554273520] [2025-01-09 15:19:08,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:08,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:08,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:19:08,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:19:08,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:08,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:08,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:08,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554273520] [2025-01-09 15:19:08,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554273520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:08,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:08,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:19:08,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345313050] [2025-01-09 15:19:08,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:08,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:19:08,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:08,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:19:08,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:19:08,344 INFO L87 Difference]: Start difference. First operand 1152 states and 1574 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:08,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:08,561 INFO L93 Difference]: Finished difference Result 1966 states and 2689 transitions. [2025-01-09 15:19:08,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:19:08,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2025-01-09 15:19:08,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:08,566 INFO L225 Difference]: With dead ends: 1966 [2025-01-09 15:19:08,566 INFO L226 Difference]: Without dead ends: 1167 [2025-01-09 15:19:08,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:19:08,568 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 93 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:08,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 608 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:19:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2025-01-09 15:19:08,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1156. [2025-01-09 15:19:08,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1005 states have (on average 1.3313432835820895) internal successors, (1338), 1005 states have internal predecessors, (1338), 120 states have call successors, (120), 30 states have call predecessors, (120), 30 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-01-09 15:19:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1578 transitions. [2025-01-09 15:19:08,666 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1578 transitions. Word has length 113 [2025-01-09 15:19:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:08,666 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1578 transitions. [2025-01-09 15:19:08,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1578 transitions. [2025-01-09 15:19:08,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 15:19:08,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:08,667 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:08,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 15:19:08,668 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:08,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:08,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1509285136, now seen corresponding path program 1 times [2025-01-09 15:19:08,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:08,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320903682] [2025-01-09 15:19:08,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:08,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:08,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:19:08,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:19:08,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:08,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:09,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:09,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320903682] [2025-01-09 15:19:09,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320903682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:09,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:09,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:19:09,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094027620] [2025-01-09 15:19:09,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:09,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:19:09,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:09,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:19:09,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:19:09,051 INFO L87 Difference]: Start difference. First operand 1156 states and 1578 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:19:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:09,622 INFO L93 Difference]: Finished difference Result 2445 states and 3342 transitions. [2025-01-09 15:19:09,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:19:09,623 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2025-01-09 15:19:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:09,629 INFO L225 Difference]: With dead ends: 2445 [2025-01-09 15:19:09,629 INFO L226 Difference]: Without dead ends: 1642 [2025-01-09 15:19:09,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:19:09,631 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 536 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:09,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1011 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:19:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2025-01-09 15:19:09,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1029. [2025-01-09 15:19:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 893 states have (on average 1.3269876819708846) internal successors, (1185), 893 states have internal predecessors, (1185), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 15:19:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1401 transitions. [2025-01-09 15:19:09,715 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1401 transitions. Word has length 113 [2025-01-09 15:19:09,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:09,715 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1401 transitions. [2025-01-09 15:19:09,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:19:09,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1401 transitions. [2025-01-09 15:19:09,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 15:19:09,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:09,717 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:09,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 15:19:09,718 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:09,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:09,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1326969405, now seen corresponding path program 1 times [2025-01-09 15:19:09,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:09,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233920682] [2025-01-09 15:19:09,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:09,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:09,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:19:09,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:19:09,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:09,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:10,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:10,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233920682] [2025-01-09 15:19:10,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233920682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:10,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:10,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:19:10,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107255961] [2025-01-09 15:19:10,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:10,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:19:10,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:10,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:19:10,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:19:10,340 INFO L87 Difference]: Start difference. First operand 1029 states and 1401 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:11,534 INFO L93 Difference]: Finished difference Result 2098 states and 2860 transitions. [2025-01-09 15:19:11,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:19:11,535 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2025-01-09 15:19:11,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:11,542 INFO L225 Difference]: With dead ends: 2098 [2025-01-09 15:19:11,543 INFO L226 Difference]: Without dead ends: 1533 [2025-01-09 15:19:11,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:19:11,545 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 661 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:11,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1018 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:19:11,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2025-01-09 15:19:11,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1043. [2025-01-09 15:19:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 907 states have (on average 1.3241455347298787) internal successors, (1201), 907 states have internal predecessors, (1201), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 15:19:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1417 transitions. [2025-01-09 15:19:11,657 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1417 transitions. Word has length 113 [2025-01-09 15:19:11,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:11,657 INFO L471 AbstractCegarLoop]: Abstraction has 1043 states and 1417 transitions. [2025-01-09 15:19:11,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:11,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1417 transitions. [2025-01-09 15:19:11,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 15:19:11,658 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:11,658 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:11,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 15:19:11,658 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:11,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:11,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1865699139, now seen corresponding path program 1 times [2025-01-09 15:19:11,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:11,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838495915] [2025-01-09 15:19:11,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:11,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:11,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:19:11,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:19:11,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:11,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 15:19:11,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:11,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838495915] [2025-01-09 15:19:11,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838495915] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:19:11,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753941395] [2025-01-09 15:19:11,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:11,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:19:11,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:19:11,759 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:19:11,765 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:19:11,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:19:11,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:19:11,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:11,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:11,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:19:11,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:11,942 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:11,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:19:11,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753941395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:11,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:19:11,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 15:19:11,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450885470] [2025-01-09 15:19:11,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:11,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:19:11,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:11,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:19:11,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:19:11,945 INFO L87 Difference]: Start difference. First operand 1043 states and 1417 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:12,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:12,039 INFO L93 Difference]: Finished difference Result 2110 states and 2867 transitions. [2025-01-09 15:19:12,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:19:12,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2025-01-09 15:19:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:12,048 INFO L225 Difference]: With dead ends: 2110 [2025-01-09 15:19:12,048 INFO L226 Difference]: Without dead ends: 1070 [2025-01-09 15:19:12,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:19:12,053 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:12,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 572 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:19:12,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2025-01-09 15:19:12,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1070. [2025-01-09 15:19:12,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 934 states have (on average 1.3147751605995717) internal successors, (1228), 934 states have internal predecessors, (1228), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 15:19:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1444 transitions. [2025-01-09 15:19:12,137 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1444 transitions. Word has length 113 [2025-01-09 15:19:12,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:12,138 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1444 transitions. [2025-01-09 15:19:12,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:12,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1444 transitions. [2025-01-09 15:19:12,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 15:19:12,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:12,140 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:12,146 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:19:12,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-09 15:19:12,340 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:12,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:12,341 INFO L85 PathProgramCache]: Analyzing trace with hash -186928351, now seen corresponding path program 1 times [2025-01-09 15:19:12,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:12,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139366343] [2025-01-09 15:19:12,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:12,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:12,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:19:12,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:19:12,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:12,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:12,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:12,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139366343] [2025-01-09 15:19:12,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139366343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:12,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:12,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:19:12,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794574824] [2025-01-09 15:19:12,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:12,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:19:12,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:12,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:19:12,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:19:12,478 INFO L87 Difference]: Start difference. First operand 1070 states and 1444 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:12,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:12,757 INFO L93 Difference]: Finished difference Result 2256 states and 3047 transitions. [2025-01-09 15:19:12,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:19:12,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2025-01-09 15:19:12,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:12,762 INFO L225 Difference]: With dead ends: 2256 [2025-01-09 15:19:12,762 INFO L226 Difference]: Without dead ends: 1423 [2025-01-09 15:19:12,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:19:12,763 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 131 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:12,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 690 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:19:12,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2025-01-09 15:19:12,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1405. [2025-01-09 15:19:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1224 states have (on average 1.309640522875817) internal successors, (1603), 1224 states have internal predecessors, (1603), 144 states have call successors, (144), 36 states have call predecessors, (144), 36 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2025-01-09 15:19:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1891 transitions. [2025-01-09 15:19:12,866 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1891 transitions. Word has length 113 [2025-01-09 15:19:12,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:12,867 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 1891 transitions. [2025-01-09 15:19:12,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:12,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1891 transitions. [2025-01-09 15:19:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 15:19:12,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:12,868 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:12,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 15:19:12,868 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:12,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:12,869 INFO L85 PathProgramCache]: Analyzing trace with hash -802730690, now seen corresponding path program 1 times [2025-01-09 15:19:12,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:12,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802021102] [2025-01-09 15:19:12,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:12,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:12,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 15:19:12,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 15:19:12,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:12,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:13,402 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:13,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:13,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802021102] [2025-01-09 15:19:13,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802021102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:13,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:13,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:19:13,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105005563] [2025-01-09 15:19:13,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:13,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:19:13,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:13,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:19:13,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:19:13,404 INFO L87 Difference]: Start difference. First operand 1405 states and 1891 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:13,962 INFO L93 Difference]: Finished difference Result 2528 states and 3403 transitions. [2025-01-09 15:19:13,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:19:13,963 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2025-01-09 15:19:13,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:13,970 INFO L225 Difference]: With dead ends: 2528 [2025-01-09 15:19:13,971 INFO L226 Difference]: Without dead ends: 1589 [2025-01-09 15:19:13,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:19:13,973 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 220 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:13,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1332 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:19:13,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2025-01-09 15:19:14,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1405. [2025-01-09 15:19:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1224 states have (on average 1.309640522875817) internal successors, (1603), 1224 states have internal predecessors, (1603), 144 states have call successors, (144), 36 states have call predecessors, (144), 36 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2025-01-09 15:19:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1891 transitions. [2025-01-09 15:19:14,077 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1891 transitions. Word has length 114 [2025-01-09 15:19:14,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:14,077 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 1891 transitions. [2025-01-09 15:19:14,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:14,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1891 transitions. [2025-01-09 15:19:14,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 15:19:14,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:14,079 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:14,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 15:19:14,079 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:14,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:14,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1830856067, now seen corresponding path program 1 times [2025-01-09 15:19:14,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:14,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116618651] [2025-01-09 15:19:14,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:14,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:14,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 15:19:14,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 15:19:14,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:14,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:14,143 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:14,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:14,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116618651] [2025-01-09 15:19:14,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116618651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:14,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:14,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:19:14,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041295163] [2025-01-09 15:19:14,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:14,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:19:14,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:14,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:19:14,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:19:14,144 INFO L87 Difference]: Start difference. First operand 1405 states and 1891 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:14,281 INFO L93 Difference]: Finished difference Result 2569 states and 3458 transitions. [2025-01-09 15:19:14,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:19:14,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2025-01-09 15:19:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:14,285 INFO L225 Difference]: With dead ends: 2569 [2025-01-09 15:19:14,285 INFO L226 Difference]: Without dead ends: 1401 [2025-01-09 15:19:14,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:19:14,287 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 93 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:14,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 519 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:19:14,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2025-01-09 15:19:14,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1289. [2025-01-09 15:19:14,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1123 states have (on average 1.3098842386464826) internal successors, (1471), 1123 states have internal predecessors, (1471), 132 states have call successors, (132), 33 states have call predecessors, (132), 33 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 15:19:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1735 transitions. [2025-01-09 15:19:14,381 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1735 transitions. Word has length 114 [2025-01-09 15:19:14,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:14,381 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1735 transitions. [2025-01-09 15:19:14,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:14,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1735 transitions. [2025-01-09 15:19:14,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 15:19:14,383 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:14,383 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:14,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 15:19:14,384 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:14,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:14,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1273621458, now seen corresponding path program 1 times [2025-01-09 15:19:14,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:14,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788631287] [2025-01-09 15:19:14,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:14,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:14,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 15:19:14,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 15:19:14,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:14,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:14,533 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:14,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:14,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788631287] [2025-01-09 15:19:14,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788631287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:14,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:14,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:19:14,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143053272] [2025-01-09 15:19:14,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:14,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:19:14,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:14,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:19:14,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:19:14,534 INFO L87 Difference]: Start difference. First operand 1289 states and 1735 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:14,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:14,837 INFO L93 Difference]: Finished difference Result 2230 states and 3002 transitions. [2025-01-09 15:19:14,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:19:14,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2025-01-09 15:19:14,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:14,842 INFO L225 Difference]: With dead ends: 2230 [2025-01-09 15:19:14,842 INFO L226 Difference]: Without dead ends: 1414 [2025-01-09 15:19:14,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:19:14,844 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 130 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:14,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 694 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:19:14,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-01-09 15:19:14,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1293. [2025-01-09 15:19:14,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1127 states have (on average 1.3087843833185449) internal successors, (1475), 1127 states have internal predecessors, (1475), 132 states have call successors, (132), 33 states have call predecessors, (132), 33 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 15:19:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1739 transitions. [2025-01-09 15:19:14,941 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1739 transitions. Word has length 114 [2025-01-09 15:19:14,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:14,941 INFO L471 AbstractCegarLoop]: Abstraction has 1293 states and 1739 transitions. [2025-01-09 15:19:14,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:14,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1739 transitions. [2025-01-09 15:19:14,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 15:19:14,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:14,942 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:14,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 15:19:14,942 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:14,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:14,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1049985320, now seen corresponding path program 1 times [2025-01-09 15:19:14,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:14,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838009802] [2025-01-09 15:19:14,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:14,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:14,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 15:19:14,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 15:19:14,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:14,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:15,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:15,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838009802] [2025-01-09 15:19:15,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838009802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:15,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:15,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:19:15,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724370422] [2025-01-09 15:19:15,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:15,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:19:15,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:15,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:19:15,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:19:15,309 INFO L87 Difference]: Start difference. First operand 1293 states and 1739 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:19:15,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:15,774 INFO L93 Difference]: Finished difference Result 2266 states and 3049 transitions. [2025-01-09 15:19:15,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:19:15,774 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2025-01-09 15:19:15,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:15,778 INFO L225 Difference]: With dead ends: 2266 [2025-01-09 15:19:15,778 INFO L226 Difference]: Without dead ends: 1446 [2025-01-09 15:19:15,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:19:15,781 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 404 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:15,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 731 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:19:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2025-01-09 15:19:15,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 935. [2025-01-09 15:19:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 814 states have (on average 1.2997542997542997) internal successors, (1058), 814 states have internal predecessors, (1058), 96 states have call successors, (96), 24 states have call predecessors, (96), 24 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 15:19:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1250 transitions. [2025-01-09 15:19:15,857 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1250 transitions. Word has length 114 [2025-01-09 15:19:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:15,858 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1250 transitions. [2025-01-09 15:19:15,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:19:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1250 transitions. [2025-01-09 15:19:15,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:19:15,858 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:15,859 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:15,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 15:19:15,859 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:15,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash -778942934, now seen corresponding path program 1 times [2025-01-09 15:19:15,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:15,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778908087] [2025-01-09 15:19:15,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:15,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:19:15,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:19:15,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:15,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:15,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:19:15,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778908087] [2025-01-09 15:19:15,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778908087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:15,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:15,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:19:15,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933820827] [2025-01-09 15:19:15,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:15,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:19:15,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:19:15,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:19:15,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:19:15,917 INFO L87 Difference]: Start difference. First operand 935 states and 1250 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:15,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:15,979 INFO L93 Difference]: Finished difference Result 1516 states and 2024 transitions. [2025-01-09 15:19:15,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:19:15,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-01-09 15:19:15,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:15,981 INFO L225 Difference]: With dead ends: 1516 [2025-01-09 15:19:15,981 INFO L226 Difference]: Without dead ends: 576 [2025-01-09 15:19:15,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:19:15,986 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:15,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:19:15,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-01-09 15:19:16,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 572. [2025-01-09 15:19:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 496 states have (on average 1.2862903225806452) internal successors, (638), 496 states have internal predecessors, (638), 60 states have call successors, (60), 15 states have call predecessors, (60), 15 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 15:19:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 758 transitions. [2025-01-09 15:19:16,036 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 758 transitions. Word has length 115 [2025-01-09 15:19:16,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:16,037 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 758 transitions. [2025-01-09 15:19:16,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 758 transitions. [2025-01-09 15:19:16,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:19:16,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:16,038 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:16,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 15:19:16,039 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:16,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:16,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1264412269, now seen corresponding path program 1 times [2025-01-09 15:19:16,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:19:16,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594944872] [2025-01-09 15:19:16,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:16,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:19:16,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:19:16,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:19:16,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:16,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:19:16,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [949446186] [2025-01-09 15:19:16,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:16,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:19:16,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:19:16,101 INFO L229 MonitoredProcess]: Starting monitored process 6 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:19:16,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 15:19:16,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:19:16,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:19:16,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:16,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:19:16,390 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:19:16,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:19:16,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:19:16,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:16,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:19:16,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:19:16,539 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:19:16,539 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:19:16,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 15:19:16,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:19:16,746 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:19:16,808 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:19:16,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:19:16 BoogieIcfgContainer [2025-01-09 15:19:16,810 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:19:16,814 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:19:16,814 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:19:16,814 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:19:16,814 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:18:47" (3/4) ... [2025-01-09 15:19:16,816 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:19:16,816 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:19:16,816 INFO L158 Benchmark]: Toolchain (without parser) took 29833.05ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 89.9MB in the end (delta: 33.7MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2025-01-09 15:19:16,816 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:19:16,817 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.55ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 109.4MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:19:16,817 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.14ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 104.9MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:19:16,817 INFO L158 Benchmark]: Boogie Preprocessor took 53.51ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 101.0MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:19:16,817 INFO L158 Benchmark]: RCFGBuilder took 516.77ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 64.9MB in the end (delta: 35.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:19:16,817 INFO L158 Benchmark]: TraceAbstraction took 28978.48ms. Allocated memory is still 167.8MB. Free memory was 64.2MB in the beginning and 94.1MB in the end (delta: -29.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:19:16,817 INFO L158 Benchmark]: Witness Printer took 2.40ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 89.9MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:19:16,818 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.55ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 109.4MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.14ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 104.9MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.51ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 101.0MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 516.77ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 64.9MB in the end (delta: 35.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 28978.48ms. Allocated memory is still 167.8MB. Free memory was 64.2MB in the beginning and 94.1MB in the end (delta: -29.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.40ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 89.9MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of bitwiseOr at line 94, overapproximation of bitwiseOr at line 59, overapproximation of bitwiseAnd at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] float float_Array_0[3] = { 5.8, 0.5, 99.25 }; [L25-L27] float float_Array_0[3] = { 5.8, 0.5, 99.25 }; [L25-L27] float float_Array_0[3] = { 5.8, 0.5, 99.25 }; [L25-L27] float float_Array_0[3] = { 5.8, 0.5, 99.25 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { 5, 18477 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { 5, 18477 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { 5, 18477 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 50, 1, 16 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 50, 1, 16 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 50, 1, 16 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 50, 1, 16 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 256 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 256 }; [L37] unsigned char last_1_unsigned_char_Array_0_2_ = 16; [L38] unsigned long int last_1_unsigned_long_int_Array_0_0_ = 256; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] isInitial = 1 [L99] FCALL initially() [L101] CALL updateLastVariables() [L90] EXPR unsigned_char_Array_0[2] [L90] last_1_unsigned_char_Array_0_2_ = unsigned_char_Array_0[2] [L91] EXPR unsigned_long_int_Array_0[0] [L91] last_1_unsigned_long_int_Array_0_0_ = unsigned_long_int_Array_0[0] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] float_Array_0[0] = __VERIFIER_nondet_float() [L73] EXPR float_Array_0[0] [L73] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L73] EXPR float_Array_0[0] [L73] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] float_Array_0[1] = __VERIFIER_nondet_float() [L75] EXPR float_Array_0[1] [L75] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L75] EXPR float_Array_0[1] [L75] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L77] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L80] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not(signed_short_int_Array_0[1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L83] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L86] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] RET updateVariables() [L103] CALL step() [L42] EXPR signed_short_int_Array_0[0] [L42] signed short int stepLocal_3 = signed_short_int_Array_0[0]; [L43] unsigned long int stepLocal_2 = last_1_unsigned_long_int_Array_0_0_; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, stepLocal_2=256, stepLocal_3=257, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L44] COND FALSE !(last_1_unsigned_long_int_Array_0_0_ > stepLocal_3) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L51] EXPR unsigned_char_Array_0[2] [L51] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L51] EXPR unsigned_char_Array_0[2] & signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, stepLocal_2=256, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L51] EXPR unsigned_char_Array_0[0] [L51] EXPR unsigned_char_Array_0[2] [L51] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L51] COND FALSE !((unsigned_char_Array_0[2] & signed_short_int_Array_0[1]) > ((unsigned_char_Array_0[0] * last_1_unsigned_long_int_Array_0_0_) * (unsigned_char_Array_0[2] + unsigned_char_Array_0[2]))) [L56] EXPR signed_short_int_Array_0[1] [L56] unsigned_long_int_Array_0[0] = signed_short_int_Array_0[1] [L58] EXPR unsigned_char_Array_0[2] [L58] unsigned char stepLocal_1 = unsigned_char_Array_0[2]; [L59] EXPR unsigned_char_Array_0[2] [L59] EXPR unsigned_char_Array_0[2] [L59] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L59] EXPR ((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]) [L59] EXPR unsigned_long_int_Array_0[0] [L59] EXPR ((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, stepLocal_1=16, stepLocal_2=256, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L59] EXPR unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, stepLocal_1=16, stepLocal_2=256, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L59] unsigned long int stepLocal_0 = unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]))); [L60] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] COND FALSE !(stepLocal_0 != unsigned_char_Array_0[2]) [L65] float_Array_0[2] = 10.5f VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR unsigned_char_Array_0[2] [L94] EXPR unsigned_char_Array_0[2] [L94] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]) [L94] EXPR unsigned_long_int_Array_0[0] [L94] EXPR ((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f)) [L94] EXPR float_Array_0[2] [L94] EXPR ((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > signed_short_int_Array_0[0]) ? ((((last_1_unsigned_char_Array_0_2_ - signed_short_int_Array_0[0]) + signed_short_int_Array_0[1]) > last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[2] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]))))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > signed_short_int_Array_0[0]) ? ((((last_1_unsigned_char_Array_0_2_ - signed_short_int_Array_0[0]) + signed_short_int_Array_0[1]) > last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[2] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]))))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > signed_short_int_Array_0[0]) ? ((((last_1_unsigned_char_Array_0_2_ - signed_short_int_Array_0[0]) + signed_short_int_Array_0[1]) > last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[2] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]))))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[0]))) : 1)) && (((unsigned_char_Array_0[2] & signed_short_int_Array_0[1]) > ((unsigned_char_Array_0[0] * last_1_unsigned_long_int_Array_0_0_) * (unsigned_char_Array_0[2] + unsigned_char_Array_0[2]))) ? ((BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] > float_Array_0[1])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1])) : 1) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > signed_short_int_Array_0[0]) ? ((((last_1_unsigned_char_Array_0_2_ - signed_short_int_Array_0[0]) + signed_short_int_Array_0[1]) > last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[2] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]))))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[0]))) : 1)) && (((unsigned_char_Array_0[2] & signed_short_int_Array_0[1]) > ((unsigned_char_Array_0[0] * last_1_unsigned_long_int_Array_0_0_) * (unsigned_char_Array_0[2] + unsigned_char_Array_0[2]))) ? ((BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] > float_Array_0[1])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1])) : 1) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94-L95] return ((((unsigned_char_Array_0[2] ^ ((((unsigned_char_Array_0[2]) > (unsigned_long_int_Array_0[0])) ? (unsigned_char_Array_0[2]) : (unsigned_long_int_Array_0[0])))) != unsigned_char_Array_0[2]) ? ((unsigned_char_Array_0[2] == (unsigned_char_Array_0[2] - (signed_short_int_Array_0[1] - unsigned_char_Array_0[2]))) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) < (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : 1) : (float_Array_0[2] == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > signed_short_int_Array_0[0]) ? ((((last_1_unsigned_char_Array_0_2_ - signed_short_int_Array_0[0]) + signed_short_int_Array_0[1]) > last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[2] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]))))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[0]))) : 1)) && (((unsigned_char_Array_0[2] & signed_short_int_Array_0[1]) > ((unsigned_char_Array_0[0] * last_1_unsigned_long_int_Array_0_0_) * (unsigned_char_Array_0[2] + unsigned_char_Array_0[2]))) ? ((BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] > float_Array_0[1])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1])) : 1) : (unsigned_long_int_Array_0[0] == ((unsigned long int) signed_short_int_Array_0[1]))) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.9s, OverallIterations: 30, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7788 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7788 mSDsluCounter, 23789 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18877 mSDsCounter, 941 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9422 IncrementalHoareTripleChecker+Invalid, 10363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 941 mSolverCounterUnsat, 4912 mSDtfsCounter, 9422 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 944 GetRequests, 641 SyntacticMatches, 1 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1799occurred in iteration=10, InterpolantAutomatonStates: 255, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 5650 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 3889 NumberOfCodeBlocks, 3889 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3733 ConstructedInterpolants, 0 QuantifiedInterpolants, 15907 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1635 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 34 InterpolantComputations, 28 PerfectInterpolantSequences, 8843/8976 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 15:19:16,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /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-a_file-18.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 34c00af4b4663198525b0b7086d994deb20901b2017b1e6c2fe4ceb71d985d42 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:19:18,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:19:18,801 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:19:18,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:19:18,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:19:18,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:19:18,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:19:18,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:19:18,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:19:18,829 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:19:18,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:19:18,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:19:18,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:19:18,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:19:18,830 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:19:18,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:19:18,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:19:18,831 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:19:18,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:19:18,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:19:18,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:19:18,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:19:18,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:19:18,832 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:19:18,832 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:19:18,832 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:19:18,832 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:19:18,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:19:18,832 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:19:18,832 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:19:18,832 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:19:18,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:19:18,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:19:18,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:19:18,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:19:18,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:19:18,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:19:18,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:19:18,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:19:18,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:19:18,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:19:18,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:19:18,834 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:19:18,834 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:19:18,834 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:19:18,834 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:19:18,834 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:19:18,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:19:18,835 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:19:18,835 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:19:18,835 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 -> 34c00af4b4663198525b0b7086d994deb20901b2017b1e6c2fe4ceb71d985d42 [2025-01-09 15:19:19,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:19:19,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:19:19,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:19:19,120 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:19:19,121 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:19:19,125 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-a_file-18.i [2025-01-09 15:19:20,301 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13dbe05c6/0152ff7210924a5da544ade476ec53f7/FLAGbc2ff14d2 [2025-01-09 15:19:20,502 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:19:20,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-18.i [2025-01-09 15:19:20,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13dbe05c6/0152ff7210924a5da544ade476ec53f7/FLAGbc2ff14d2 [2025-01-09 15:19:20,879 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13dbe05c6/0152ff7210924a5da544ade476ec53f7 [2025-01-09 15:19:20,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:19:20,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:19:20,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:19:20,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:19:20,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:19:20,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:19:20" (1/1) ... [2025-01-09 15:19:20,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29109e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:20, skipping insertion in model container [2025-01-09 15:19:20,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:19:20" (1/1) ... [2025-01-09 15:19:20,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:19:20,997 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-a_file-18.i[916,929] [2025-01-09 15:19:21,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:19:21,046 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:19:21,056 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-a_file-18.i[916,929] [2025-01-09 15:19:21,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:19:21,110 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:19:21,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:21 WrapperNode [2025-01-09 15:19:21,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:19:21,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:19:21,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:19:21,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:19:21,117 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:19:21" (1/1) ... [2025-01-09 15:19:21,133 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:19:21" (1/1) ... [2025-01-09 15:19:21,167 INFO L138 Inliner]: procedures = 36, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 437 [2025-01-09 15:19:21,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:19:21,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:19:21,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:19:21,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:19:21,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:21" (1/1) ... [2025-01-09 15:19:21,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:21" (1/1) ... [2025-01-09 15:19:21,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:21" (1/1) ... [2025-01-09 15:19:21,206 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 6, 29, 22, 46, 10]. 40 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 2, 3, 1]. The 13 writes are split as follows [0, 1, 4, 2, 4, 2]. [2025-01-09 15:19:21,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:21" (1/1) ... [2025-01-09 15:19:21,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:21" (1/1) ... [2025-01-09 15:19:21,231 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:21" (1/1) ... [2025-01-09 15:19:21,232 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:21" (1/1) ... [2025-01-09 15:19:21,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:21" (1/1) ... [2025-01-09 15:19:21,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:21" (1/1) ... [2025-01-09 15:19:21,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:21" (1/1) ... [2025-01-09 15:19:21,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:19:21,253 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:19:21,253 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:19:21,253 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:19:21,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:21" (1/1) ... [2025-01-09 15:19:21,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:19:21,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:19:21,290 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:19:21,293 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:19:21,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:19:21,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:19:21,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:19:21,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:19:21,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:19:21,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:19:21,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-01-09 15:19:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:19:21,309 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:19:21,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:19:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:19:21,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:19:21,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:19:21,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:19:21,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:19:21,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-01-09 15:19:21,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-01-09 15:19:21,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-01-09 15:19:21,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-01-09 15:19:21,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 15:19:21,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 15:19:21,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-01-09 15:19:21,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-01-09 15:19:21,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-01-09 15:19:21,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-01-09 15:19:21,467 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:19:21,468 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:19:22,041 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-01-09 15:19:22,041 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:19:22,052 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:19:22,052 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:19:22,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:19:22 BoogieIcfgContainer [2025-01-09 15:19:22,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:19:22,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:19:22,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:19:22,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:19:22,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:19:20" (1/3) ... [2025-01-09 15:19:22,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5d24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:19:22, skipping insertion in model container [2025-01-09 15:19:22,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:19:21" (2/3) ... [2025-01-09 15:19:22,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5d24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:19:22, skipping insertion in model container [2025-01-09 15:19:22,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:19:22" (3/3) ... [2025-01-09 15:19:22,062 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-18.i [2025-01-09 15:19:22,072 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:19:22,074 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-18.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:19:22,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:19:22,115 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;@693f5e65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:19:22,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:19:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:19:22,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 15:19:22,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:22,126 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:22,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:22,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:22,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1940838168, now seen corresponding path program 1 times [2025-01-09 15:19:22,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:19:22,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162912226] [2025-01-09 15:19:22,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:22,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:22,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:19:22,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:19:22,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 15:19:22,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:19:22,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:19:22,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:22,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:22,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:19:22,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:22,383 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-01-09 15:19:22,383 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:19:22,384 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:19:22,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162912226] [2025-01-09 15:19:22,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162912226] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:22,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:22,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:19:22,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38837773] [2025-01-09 15:19:22,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:22,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:19:22,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:19:22,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:19:22,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:19:22,425 INFO L87 Difference]: Start difference. First operand has 91 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:19:22,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:22,460 INFO L93 Difference]: Finished difference Result 176 states and 271 transitions. [2025-01-09 15:19:22,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:19:22,461 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-01-09 15:19:22,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:22,465 INFO L225 Difference]: With dead ends: 176 [2025-01-09 15:19:22,465 INFO L226 Difference]: Without dead ends: 88 [2025-01-09 15:19:22,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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:19:22,468 INFO L435 NwaCegarLoop]: 127 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, 127 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:19:22,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:19:22,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-09 15:19:22,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-09 15:19:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:19:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2025-01-09 15:19:22,496 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 103 [2025-01-09 15:19:22,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:22,496 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2025-01-09 15:19:22,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:19:22,497 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2025-01-09 15:19:22,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 15:19:22,498 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:22,498 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:22,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:19:22,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:22,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:22,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:22,703 INFO L85 PathProgramCache]: Analyzing trace with hash -487298364, now seen corresponding path program 1 times [2025-01-09 15:19:22,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:19:22,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142609411] [2025-01-09 15:19:22,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:22,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:22,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:19:22,706 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:19:22,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 15:19:22,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:19:22,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:19:22,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:22,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:22,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:19:22,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:23,035 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-01-09 15:19:23,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:19:23,036 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:19:23,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142609411] [2025-01-09 15:19:23,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142609411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:23,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:23,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:19:23,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230530805] [2025-01-09 15:19:23,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:23,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:19:23,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:19:23,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:19:23,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:19:23,038 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:19:23,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:23,070 INFO L93 Difference]: Finished difference Result 175 states and 254 transitions. [2025-01-09 15:19:23,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:19:23,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-01-09 15:19:23,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:23,071 INFO L225 Difference]: With dead ends: 175 [2025-01-09 15:19:23,071 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 15:19:23,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 100 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:19:23,072 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 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:19:23,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:19:23,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 15:19:23,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-09 15:19:23,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:19:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2025-01-09 15:19:23,083 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 103 [2025-01-09 15:19:23,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:23,084 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2025-01-09 15:19:23,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:19:23,084 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2025-01-09 15:19:23,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 15:19:23,088 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:23,088 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:23,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 15:19:23,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:23,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:23,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:23,294 INFO L85 PathProgramCache]: Analyzing trace with hash -514363966, now seen corresponding path program 1 times [2025-01-09 15:19:23,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:19:23,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193320902] [2025-01-09 15:19:23,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:23,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:23,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:19:23,299 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:19:23,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 15:19:23,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:19:23,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:19:23,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:23,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:23,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 15:19:23,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:23,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-01-09 15:19:23,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 15:19:23,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 15:19:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 15:19:23,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:19:23,903 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:19:23,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193320902] [2025-01-09 15:19:23,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193320902] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:19:23,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1984009828] [2025-01-09 15:19:23,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:23,904 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:19:23,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:19:23,905 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:19:23,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-01-09 15:19:24,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:19:24,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:19:24,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:24,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:24,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 15:19:24,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:24,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:19:24,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 15:19:24,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-01-09 15:19:24,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 15:19:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 15:19:24,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:19:24,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1984009828] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:19:24,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:19:24,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2025-01-09 15:19:24,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724675067] [2025-01-09 15:19:24,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:19:24,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:19:24,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:19:24,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:19:24,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:19:24,683 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 14 states have internal predecessors, (88), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-01-09 15:19:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:25,816 INFO L93 Difference]: Finished difference Result 278 states and 394 transitions. [2025-01-09 15:19:25,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 15:19:25,816 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 14 states have internal predecessors, (88), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 103 [2025-01-09 15:19:25,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:25,818 INFO L225 Difference]: With dead ends: 278 [2025-01-09 15:19:25,818 INFO L226 Difference]: Without dead ends: 191 [2025-01-09 15:19:25,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 233 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=849, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 15:19:25,820 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 253 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:25,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1086 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:19:25,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-09 15:19:25,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2025-01-09 15:19:25,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 156 states have (on average 1.3717948717948718) internal successors, (214), 156 states have internal predecessors, (214), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:19:25,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 262 transitions. [2025-01-09 15:19:25,839 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 262 transitions. Word has length 103 [2025-01-09 15:19:25,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:25,839 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 262 transitions. [2025-01-09 15:19:25,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 14 states have internal predecessors, (88), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-01-09 15:19:25,839 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 262 transitions. [2025-01-09 15:19:25,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 15:19:25,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:25,840 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:25,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 15:19:26,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2025-01-09 15:19:26,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 15:19:26,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:26,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:26,242 INFO L85 PathProgramCache]: Analyzing trace with hash 765499712, now seen corresponding path program 1 times [2025-01-09 15:19:26,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:19:26,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613911254] [2025-01-09 15:19:26,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:26,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:26,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:19:26,245 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:19:26,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 15:19:26,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:19:26,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:19:26,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:26,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:26,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 15:19:26,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:26,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-01-09 15:19:26,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 15:19:26,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 15:19:26,585 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 15:19:26,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:19:26,672 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:19:26,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613911254] [2025-01-09 15:19:26,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613911254] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:19:26,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1833366764] [2025-01-09 15:19:26,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:26,673 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:19:26,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:19:26,679 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:19:26,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-01-09 15:19:26,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:19:27,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:19:27,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:27,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:27,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 15:19:27,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:27,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 15:19:27,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 15:19:27,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-01-09 15:19:27,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 15:19:27,567 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 15:19:27,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:19:27,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1833366764] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:19:27,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:19:27,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2025-01-09 15:19:27,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390493150] [2025-01-09 15:19:27,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:19:27,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:19:27,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:19:27,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:19:27,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:19:27,607 INFO L87 Difference]: Start difference. First operand 185 states and 262 transitions. Second operand has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-01-09 15:19:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:28,979 INFO L93 Difference]: Finished difference Result 282 states and 395 transitions. [2025-01-09 15:19:28,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 15:19:28,983 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 103 [2025-01-09 15:19:28,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:28,984 INFO L225 Difference]: With dead ends: 282 [2025-01-09 15:19:28,984 INFO L226 Difference]: Without dead ends: 189 [2025-01-09 15:19:28,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2025-01-09 15:19:28,989 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 385 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:28,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 951 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 15:19:28,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-01-09 15:19:29,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 183. [2025-01-09 15:19:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 154 states have (on average 1.3636363636363635) internal successors, (210), 154 states have internal predecessors, (210), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:19:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 258 transitions. [2025-01-09 15:19:29,023 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 258 transitions. Word has length 103 [2025-01-09 15:19:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:29,024 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 258 transitions. [2025-01-09 15:19:29,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-01-09 15:19:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 258 transitions. [2025-01-09 15:19:29,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:19:29,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:29,029 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:29,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-01-09 15:19:29,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 15:19:29,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:29,430 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:29,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:29,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1896674248, now seen corresponding path program 1 times [2025-01-09 15:19:29,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:19:29,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251431755] [2025-01-09 15:19:29,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:29,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:29,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:19:29,437 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:19:29,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 15:19:29,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:19:29,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:19:29,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:29,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:29,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 15:19:29,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:29,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-01-09 15:19:29,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 15:19:29,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 15:19:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 15:19:29,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:19:29,877 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:19:29,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251431755] [2025-01-09 15:19:29,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251431755] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:19:29,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [267293699] [2025-01-09 15:19:29,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:29,878 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:19:29,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:19:29,880 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:19:29,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-01-09 15:19:30,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:19:30,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:19:30,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:30,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:30,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 15:19:30,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:30,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:19:30,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 15:19:30,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-01-09 15:19:30,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 15:19:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 15:19:30,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:19:30,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [267293699] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:19:30,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:19:30,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2025-01-09 15:19:30,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771747177] [2025-01-09 15:19:30,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:19:30,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:19:30,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:19:30,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:19:30,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:19:30,648 INFO L87 Difference]: Start difference. First operand 183 states and 258 transitions. Second operand has 13 states, 11 states have (on average 8.090909090909092) internal successors, (89), 13 states have internal predecessors, (89), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-01-09 15:19:31,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:31,650 INFO L93 Difference]: Finished difference Result 280 states and 390 transitions. [2025-01-09 15:19:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 15:19:31,650 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.090909090909092) internal successors, (89), 13 states have internal predecessors, (89), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 104 [2025-01-09 15:19:31,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:31,653 INFO L225 Difference]: With dead ends: 280 [2025-01-09 15:19:31,653 INFO L226 Difference]: Without dead ends: 189 [2025-01-09 15:19:31,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=680, Unknown=0, NotChecked=0, Total=870 [2025-01-09 15:19:31,655 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 239 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:31,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 954 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:19:31,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-01-09 15:19:31,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 183. [2025-01-09 15:19:31,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:19:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 257 transitions. [2025-01-09 15:19:31,671 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 257 transitions. Word has length 104 [2025-01-09 15:19:31,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:31,672 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 257 transitions. [2025-01-09 15:19:31,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.090909090909092) internal successors, (89), 13 states have internal predecessors, (89), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-01-09 15:19:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 257 transitions. [2025-01-09 15:19:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:19:31,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:31,673 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:31,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-01-09 15:19:31,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-01-09 15:19:32,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 15:19:32,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:32,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:32,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1195609670, now seen corresponding path program 1 times [2025-01-09 15:19:32,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:19:32,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952781749] [2025-01-09 15:19:32,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:32,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:32,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:19:32,078 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:19:32,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-01-09 15:19:32,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:19:32,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:19:32,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:32,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:32,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:19:32,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:32,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2025-01-09 15:19:32,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2025-01-09 15:19:32,372 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:32,372 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:19:32,372 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:19:32,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952781749] [2025-01-09 15:19:32,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952781749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:32,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:32,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:19:32,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417245292] [2025-01-09 15:19:32,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:32,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:19:32,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:19:32,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:19:32,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:19:32,373 INFO L87 Difference]: Start difference. First operand 183 states and 257 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:32,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:32,936 INFO L93 Difference]: Finished difference Result 371 states and 521 transitions. [2025-01-09 15:19:32,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:19:32,937 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-01-09 15:19:32,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:32,938 INFO L225 Difference]: With dead ends: 371 [2025-01-09 15:19:32,938 INFO L226 Difference]: Without dead ends: 191 [2025-01-09 15:19:32,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:19:32,939 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 123 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:32,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 542 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:19:32,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-09 15:19:32,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2025-01-09 15:19:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 158 states have (on average 1.3417721518987342) internal successors, (212), 158 states have internal predecessors, (212), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:19:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 260 transitions. [2025-01-09 15:19:32,964 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 260 transitions. Word has length 104 [2025-01-09 15:19:32,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:32,965 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 260 transitions. [2025-01-09 15:19:32,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:32,965 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 260 transitions. [2025-01-09 15:19:32,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 15:19:32,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:32,966 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:32,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-01-09 15:19:33,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:33,167 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:33,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:33,167 INFO L85 PathProgramCache]: Analyzing trace with hash -400647368, now seen corresponding path program 1 times [2025-01-09 15:19:33,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:19:33,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231085019] [2025-01-09 15:19:33,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:33,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:33,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:19:33,169 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:19:33,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-01-09 15:19:33,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 15:19:33,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 15:19:33,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:33,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:33,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:19:33,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:33,550 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:19:33,550 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:19:33,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231085019] [2025-01-09 15:19:33,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231085019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:33,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:33,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:19:33,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860017808] [2025-01-09 15:19:33,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:33,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:19:33,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:19:33,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:19:33,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:19:33,551 INFO L87 Difference]: Start difference. First operand 187 states and 260 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:33,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:33,663 INFO L93 Difference]: Finished difference Result 371 states and 515 transitions. [2025-01-09 15:19:33,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:19:33,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-01-09 15:19:33,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:33,665 INFO L225 Difference]: With dead ends: 371 [2025-01-09 15:19:33,665 INFO L226 Difference]: Without dead ends: 187 [2025-01-09 15:19:33,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:19:33,666 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 67 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:33,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 433 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:19:33,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-09 15:19:33,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2025-01-09 15:19:33,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 156 states have (on average 1.3333333333333333) internal successors, (208), 156 states have internal predecessors, (208), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:19:33,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 256 transitions. [2025-01-09 15:19:33,682 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 256 transitions. Word has length 105 [2025-01-09 15:19:33,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:33,682 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 256 transitions. [2025-01-09 15:19:33,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:33,682 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 256 transitions. [2025-01-09 15:19:33,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 15:19:33,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:33,684 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:33,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-01-09 15:19:33,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:33,885 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:33,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:33,885 INFO L85 PathProgramCache]: Analyzing trace with hash -198738836, now seen corresponding path program 1 times [2025-01-09 15:19:33,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:19:33,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894011949] [2025-01-09 15:19:33,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:33,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:33,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:19:33,887 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:19:33,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-01-09 15:19:33,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 15:19:34,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 15:19:34,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:34,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:34,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:19:34,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:34,082 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:34,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:19:34,083 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:19:34,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894011949] [2025-01-09 15:19:34,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894011949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:34,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:34,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:19:34,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351907165] [2025-01-09 15:19:34,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:34,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:19:34,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:19:34,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:19:34,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:19:34,084 INFO L87 Difference]: Start difference. First operand 185 states and 256 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:34,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:34,132 INFO L93 Difference]: Finished difference Result 373 states and 517 transitions. [2025-01-09 15:19:34,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:19:34,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2025-01-09 15:19:34,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:34,136 INFO L225 Difference]: With dead ends: 373 [2025-01-09 15:19:34,136 INFO L226 Difference]: Without dead ends: 191 [2025-01-09 15:19:34,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:19:34,137 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:34,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 473 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:19:34,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-09 15:19:34,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-01-09 15:19:34,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 162 states have (on average 1.3209876543209877) internal successors, (214), 162 states have internal predecessors, (214), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 15:19:34,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 262 transitions. [2025-01-09 15:19:34,153 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 262 transitions. Word has length 106 [2025-01-09 15:19:34,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:34,154 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 262 transitions. [2025-01-09 15:19:34,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:34,154 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 262 transitions. [2025-01-09 15:19:34,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 15:19:34,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:34,155 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:34,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-01-09 15:19:34,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:34,355 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:34,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:34,356 INFO L85 PathProgramCache]: Analyzing trace with hash 607471936, now seen corresponding path program 1 times [2025-01-09 15:19:34,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:19:34,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990545810] [2025-01-09 15:19:34,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:34,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:34,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:19:34,359 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:19:34,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-01-09 15:19:34,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 15:19:34,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 15:19:34,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:34,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:34,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:19:34,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:34,660 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:34,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:19:34,660 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:19:34,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990545810] [2025-01-09 15:19:34,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990545810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:34,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:34,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:19:34,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146371175] [2025-01-09 15:19:34,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:34,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:19:34,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:19:34,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:19:34,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:19:34,661 INFO L87 Difference]: Start difference. First operand 191 states and 262 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:34,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:34,793 INFO L93 Difference]: Finished difference Result 379 states and 519 transitions. [2025-01-09 15:19:34,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:19:34,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2025-01-09 15:19:34,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:34,795 INFO L225 Difference]: With dead ends: 379 [2025-01-09 15:19:34,795 INFO L226 Difference]: Without dead ends: 191 [2025-01-09 15:19:34,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:19:34,795 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 60 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:34,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 429 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:19:34,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-09 15:19:34,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 97. [2025-01-09 15:19:34,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 82 states have internal predecessors, (107), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:19:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2025-01-09 15:19:34,818 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 106 [2025-01-09 15:19:34,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:34,818 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2025-01-09 15:19:34,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2025-01-09 15:19:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:19:34,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:34,822 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:34,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-01-09 15:19:35,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:35,024 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:35,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:35,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2051966481, now seen corresponding path program 1 times [2025-01-09 15:19:35,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:19:35,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836026985] [2025-01-09 15:19:35,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:35,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:35,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:19:35,027 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:19:35,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-01-09 15:19:35,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:19:35,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:19:35,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:35,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:35,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:19:35,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:35,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2025-01-09 15:19:35,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-01-09 15:19:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:35,286 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:19:35,286 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:19:35,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836026985] [2025-01-09 15:19:35,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836026985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:35,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:35,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:19:35,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718693847] [2025-01-09 15:19:35,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:35,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:19:35,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:19:35,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:19:35,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:19:35,288 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:35,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:35,626 INFO L93 Difference]: Finished difference Result 248 states and 335 transitions. [2025-01-09 15:19:35,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:19:35,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-01-09 15:19:35,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:35,627 INFO L225 Difference]: With dead ends: 248 [2025-01-09 15:19:35,628 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 15:19:35,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:19:35,628 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 70 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:35,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 362 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:19:35,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 15:19:35,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2025-01-09 15:19:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 129 states have (on average 1.302325581395349) internal successors, (168), 130 states have internal predecessors, (168), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:19:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 204 transitions. [2025-01-09 15:19:35,658 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 204 transitions. Word has length 108 [2025-01-09 15:19:35,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:35,658 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 204 transitions. [2025-01-09 15:19:35,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:35,658 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 204 transitions. [2025-01-09 15:19:35,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:19:35,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:35,660 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:35,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-01-09 15:19:35,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:35,861 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:35,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:35,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1704271081, now seen corresponding path program 1 times [2025-01-09 15:19:35,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:19:35,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611428931] [2025-01-09 15:19:35,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:35,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:35,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:19:35,865 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:19:35,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-01-09 15:19:35,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:19:36,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:19:36,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:36,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:36,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:19:36,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:36,046 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:19:36,047 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:19:36,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611428931] [2025-01-09 15:19:36,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611428931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:36,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:36,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:19:36,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373017088] [2025-01-09 15:19:36,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:36,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:19:36,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:19:36,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:19:36,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:19:36,048 INFO L87 Difference]: Start difference. First operand 151 states and 204 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:36,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:36,076 INFO L93 Difference]: Finished difference Result 305 states and 413 transitions. [2025-01-09 15:19:36,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:19:36,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-01-09 15:19:36,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:36,078 INFO L225 Difference]: With dead ends: 305 [2025-01-09 15:19:36,078 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 15:19:36,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:19:36,079 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:36,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 464 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:19:36,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 15:19:36,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-01-09 15:19:36,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 135 states have (on average 1.288888888888889) internal successors, (174), 136 states have internal predecessors, (174), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:19:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 210 transitions. [2025-01-09 15:19:36,093 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 210 transitions. Word has length 108 [2025-01-09 15:19:36,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:36,093 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 210 transitions. [2025-01-09 15:19:36,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:36,094 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 210 transitions. [2025-01-09 15:19:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:19:36,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:36,094 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:36,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-01-09 15:19:36,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:36,299 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:36,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:36,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2120139163, now seen corresponding path program 1 times [2025-01-09 15:19:36,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:19:36,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900507544] [2025-01-09 15:19:36,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:36,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:36,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:19:36,302 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:19:36,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-01-09 15:19:36,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:19:36,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:19:36,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:36,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:36,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:19:36,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:36,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 15:19:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:36,832 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:19:36,832 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:19:36,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900507544] [2025-01-09 15:19:36,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900507544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:36,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:36,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:19:36,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215167494] [2025-01-09 15:19:36,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:36,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:19:36,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:19:36,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:19:36,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:19:36,833 INFO L87 Difference]: Start difference. First operand 157 states and 210 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:39,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:19:43,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:19:45,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:19:48,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:19:50,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:19:50,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:50,750 INFO L93 Difference]: Finished difference Result 711 states and 941 transitions. [2025-01-09 15:19:50,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:19:50,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-01-09 15:19:50,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:50,764 INFO L225 Difference]: With dead ends: 711 [2025-01-09 15:19:50,767 INFO L226 Difference]: Without dead ends: 557 [2025-01-09 15:19:50,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:19:50,769 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 303 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 34 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:50,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 747 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 276 Invalid, 4 Unknown, 0 Unchecked, 13.8s Time] [2025-01-09 15:19:50,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-09 15:19:50,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 449. [2025-01-09 15:19:50,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 396 states have (on average 1.2828282828282829) internal successors, (508), 400 states have internal predecessors, (508), 44 states have call successors, (44), 8 states have call predecessors, (44), 8 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 15:19:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 596 transitions. [2025-01-09 15:19:50,830 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 596 transitions. Word has length 110 [2025-01-09 15:19:50,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:50,831 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 596 transitions. [2025-01-09 15:19:50,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 596 transitions. [2025-01-09 15:19:50,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:19:50,838 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:50,838 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:50,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2025-01-09 15:19:51,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:51,040 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:51,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:51,040 INFO L85 PathProgramCache]: Analyzing trace with hash 350324259, now seen corresponding path program 1 times [2025-01-09 15:19:51,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:19:51,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863063329] [2025-01-09 15:19:51,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:51,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:51,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:19:51,043 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:19:51,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-01-09 15:19:51,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:19:51,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:19:51,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:51,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:51,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 15:19:51,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:51,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-01-09 15:19:51,339 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:19:51,340 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:19:51,340 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:19:51,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863063329] [2025-01-09 15:19:51,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863063329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:19:51,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:19:51,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:19:51,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055123017] [2025-01-09 15:19:51,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:19:51,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:19:51,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:19:51,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:19:51,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:19:51,342 INFO L87 Difference]: Start difference. First operand 449 states and 596 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:51,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:51,602 INFO L93 Difference]: Finished difference Result 588 states and 778 transitions. [2025-01-09 15:19:51,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:19:51,603 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-01-09 15:19:51,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:51,605 INFO L225 Difference]: With dead ends: 588 [2025-01-09 15:19:51,605 INFO L226 Difference]: Without dead ends: 586 [2025-01-09 15:19:51,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:19:51,606 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 72 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:51,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 811 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:19:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-01-09 15:19:51,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 486. [2025-01-09 15:19:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 433 states have (on average 1.28175519630485) internal successors, (555), 437 states have internal predecessors, (555), 44 states have call successors, (44), 8 states have call predecessors, (44), 8 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 15:19:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 643 transitions. [2025-01-09 15:19:51,631 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 643 transitions. Word has length 110 [2025-01-09 15:19:51,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:51,631 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 643 transitions. [2025-01-09 15:19:51,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:19:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 643 transitions. [2025-01-09 15:19:51,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:19:51,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:51,633 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:51,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2025-01-09 15:19:51,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:51,838 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:51,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:51,838 INFO L85 PathProgramCache]: Analyzing trace with hash -562466580, now seen corresponding path program 1 times [2025-01-09 15:19:51,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:19:51,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120863868] [2025-01-09 15:19:51,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:51,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:51,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:19:51,840 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:19:51,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-01-09 15:19:51,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:19:52,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:19:52,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:52,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:52,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:19:52,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:52,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-09 15:19:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 15:19:52,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:19:52,272 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:19:52,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120863868] [2025-01-09 15:19:52,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120863868] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:19:52,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [587775357] [2025-01-09 15:19:52,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:52,272 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:19:52,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:19:52,275 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:19:52,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2025-01-09 15:19:52,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:19:52,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:19:52,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:52,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:53,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:19:53,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:53,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:19:53,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-01-09 15:19:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 15:19:53,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:19:53,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [587775357] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:19:53,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:19:53,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-01-09 15:19:53,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362728432] [2025-01-09 15:19:53,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:19:53,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:19:53,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:19:53,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:19:53,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:19:53,330 INFO L87 Difference]: Start difference. First operand 486 states and 643 transitions. Second operand has 12 states, 10 states have (on average 9.9) internal successors, (99), 12 states have internal predecessors, (99), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-01-09 15:19:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:19:53,784 INFO L93 Difference]: Finished difference Result 780 states and 1020 transitions. [2025-01-09 15:19:53,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:19:53,785 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 9.9) internal successors, (99), 12 states have internal predecessors, (99), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 110 [2025-01-09 15:19:53,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:19:53,788 INFO L225 Difference]: With dead ends: 780 [2025-01-09 15:19:53,788 INFO L226 Difference]: Without dead ends: 297 [2025-01-09 15:19:53,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:19:53,790 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 135 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:19:53,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 448 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:19:53,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-01-09 15:19:53,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 287. [2025-01-09 15:19:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 251 states have (on average 1.2310756972111554) internal successors, (309), 252 states have internal predecessors, (309), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:19:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 365 transitions. [2025-01-09 15:19:53,807 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 365 transitions. Word has length 110 [2025-01-09 15:19:53,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:19:53,807 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 365 transitions. [2025-01-09 15:19:53,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 9.9) internal successors, (99), 12 states have internal predecessors, (99), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-01-09 15:19:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 365 transitions. [2025-01-09 15:19:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 15:19:53,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:19:53,808 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:53,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2025-01-09 15:19:54,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2025-01-09 15:19:54,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:54,216 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:19:54,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:19:54,217 INFO L85 PathProgramCache]: Analyzing trace with hash 671279245, now seen corresponding path program 1 times [2025-01-09 15:19:54,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:19:54,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745204569] [2025-01-09 15:19:54,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:54,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:19:54,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:19:54,219 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:19:54,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2025-01-09 15:19:54,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:19:54,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:19:54,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:54,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:54,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 15:19:54,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:54,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-01-09 15:19:54,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:19:54,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2025-01-09 15:19:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 15:19:54,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:19:55,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:19:55,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2025-01-09 15:19:55,372 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:19:55,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745204569] [2025-01-09 15:19:55,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745204569] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:19:55,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [211455470] [2025-01-09 15:19:55,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:19:55,373 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:19:55,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:19:55,375 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:19:55,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2025-01-09 15:19:55,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:19:55,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:19:55,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:19:55,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:19:55,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 15:19:55,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:19:55,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-01-09 15:19:56,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 15:19:57,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:19:57,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 23 [2025-01-09 15:19:57,106 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 15:19:57,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:19:57,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-01-09 15:19:57,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [211455470] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:19:57,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:19:57,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2025-01-09 15:19:57,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686763871] [2025-01-09 15:19:57,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:19:57,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 15:19:57,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:19:57,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 15:19:57,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2025-01-09 15:19:57,780 INFO L87 Difference]: Start difference. First operand 287 states and 365 transitions. Second operand has 20 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-01-09 15:20:00,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:20:00,339 INFO L93 Difference]: Finished difference Result 805 states and 1014 transitions. [2025-01-09 15:20:00,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 15:20:00,340 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 111 [2025-01-09 15:20:00,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:20:00,344 INFO L225 Difference]: With dead ends: 805 [2025-01-09 15:20:00,344 INFO L226 Difference]: Without dead ends: 521 [2025-01-09 15:20:00,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=452, Invalid=1618, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 15:20:00,345 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 403 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:20:00,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1392 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 15:20:00,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-01-09 15:20:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 410. [2025-01-09 15:20:00,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 358 states have (on average 1.217877094972067) internal successors, (436), 359 states have internal predecessors, (436), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 15:20:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 516 transitions. [2025-01-09 15:20:00,378 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 516 transitions. Word has length 111 [2025-01-09 15:20:00,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:20:00,378 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 516 transitions. [2025-01-09 15:20:00,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 6 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-01-09 15:20:00,378 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 516 transitions. [2025-01-09 15:20:00,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:20:00,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:20:00,380 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:00,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2025-01-09 15:20:00,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2025-01-09 15:20:00,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 15:20:00,785 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:20:00,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:20:00,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1275863765, now seen corresponding path program 1 times [2025-01-09 15:20:00,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:20:00,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307693458] [2025-01-09 15:20:00,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:20:00,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:20:00,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:20:00,789 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:20:00,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2025-01-09 15:20:00,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:20:01,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:20:01,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:20:01,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:20:01,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 15:20:01,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:20:01,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:20:01,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 42 [2025-01-09 15:20:01,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-01-09 15:20:01,438 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:20:01,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:20:01,438 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:20:01,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307693458] [2025-01-09 15:20:01,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307693458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:20:01,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:20:01,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:20:01,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534541073] [2025-01-09 15:20:01,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:20:01,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:20:01,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:20:01,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:20:01,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:20:01,440 INFO L87 Difference]: Start difference. First operand 410 states and 516 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:20:02,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:20:02,571 INFO L93 Difference]: Finished difference Result 958 states and 1194 transitions. [2025-01-09 15:20:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:20:02,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2025-01-09 15:20:02,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:20:02,582 INFO L225 Difference]: With dead ends: 958 [2025-01-09 15:20:02,583 INFO L226 Difference]: Without dead ends: 551 [2025-01-09 15:20:02,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:20:02,585 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 190 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:20:02,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 697 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 15:20:02,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-01-09 15:20:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 464. [2025-01-09 15:20:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 412 states have (on average 1.1941747572815533) internal successors, (492), 413 states have internal predecessors, (492), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 15:20:02,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 572 transitions. [2025-01-09 15:20:02,630 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 572 transitions. Word has length 112 [2025-01-09 15:20:02,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:20:02,630 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 572 transitions. [2025-01-09 15:20:02,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:20:02,630 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 572 transitions. [2025-01-09 15:20:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 15:20:02,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:20:02,631 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:02,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2025-01-09 15:20:02,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:20:02,835 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:20:02,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:20:02,835 INFO L85 PathProgramCache]: Analyzing trace with hash 97254981, now seen corresponding path program 1 times [2025-01-09 15:20:02,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:20:02,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127154145] [2025-01-09 15:20:02,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:20:02,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:20:02,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:20:02,838 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:20:02,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2025-01-09 15:20:02,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:20:03,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:20:03,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:20:03,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:20:03,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 15:20:03,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:20:03,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-01-09 15:20:03,129 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:20:03,130 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:20:03,130 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:20:03,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127154145] [2025-01-09 15:20:03,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127154145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:20:03,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:20:03,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:20:03,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407779678] [2025-01-09 15:20:03,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:20:03,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:20:03,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:20:03,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:20:03,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:20:03,132 INFO L87 Difference]: Start difference. First operand 464 states and 572 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:20:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:20:03,429 INFO L93 Difference]: Finished difference Result 529 states and 654 transitions. [2025-01-09 15:20:03,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:20:03,432 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2025-01-09 15:20:03,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:20:03,434 INFO L225 Difference]: With dead ends: 529 [2025-01-09 15:20:03,434 INFO L226 Difference]: Without dead ends: 527 [2025-01-09 15:20:03,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:20:03,435 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 60 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:20:03,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 896 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:20:03,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-01-09 15:20:03,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 482. [2025-01-09 15:20:03,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 430 states have (on average 1.1906976744186046) internal successors, (512), 431 states have internal predecessors, (512), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 15:20:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 592 transitions. [2025-01-09 15:20:03,460 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 592 transitions. Word has length 113 [2025-01-09 15:20:03,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:20:03,460 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 592 transitions. [2025-01-09 15:20:03,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:20:03,460 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 592 transitions. [2025-01-09 15:20:03,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:20:03,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:20:03,461 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:03,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2025-01-09 15:20:03,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:20:03,665 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:20:03,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:20:03,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1560930877, now seen corresponding path program 1 times [2025-01-09 15:20:03,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:20:03,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573928760] [2025-01-09 15:20:03,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:20:03,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:20:03,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:20:03,668 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:20:03,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2025-01-09 15:20:03,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:20:03,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:20:03,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:20:03,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:20:03,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:20:03,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:20:04,056 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-01-09 15:20:04,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:20:04,129 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:20:04,129 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:20:04,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573928760] [2025-01-09 15:20:04,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573928760] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:20:04,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:20:04,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-01-09 15:20:04,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530343070] [2025-01-09 15:20:04,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:20:04,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:20:04,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:20:04,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:20:04,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:20:04,130 INFO L87 Difference]: Start difference. First operand 482 states and 592 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:20:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:20:04,301 INFO L93 Difference]: Finished difference Result 1202 states and 1463 transitions. [2025-01-09 15:20:04,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:20:04,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-01-09 15:20:04,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:20:04,308 INFO L225 Difference]: With dead ends: 1202 [2025-01-09 15:20:04,308 INFO L226 Difference]: Without dead ends: 723 [2025-01-09 15:20:04,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:20:04,309 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 24 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:20:04,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 485 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:20:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-01-09 15:20:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 675. [2025-01-09 15:20:04,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 623 states have (on average 1.1717495987158908) internal successors, (730), 624 states have internal predecessors, (730), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 15:20:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 810 transitions. [2025-01-09 15:20:04,336 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 810 transitions. Word has length 115 [2025-01-09 15:20:04,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:20:04,337 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 810 transitions. [2025-01-09 15:20:04,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:20:04,337 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 810 transitions. [2025-01-09 15:20:04,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:20:04,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:20:04,338 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:04,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2025-01-09 15:20:04,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:20:04,538 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:20:04,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:20:04,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2070403967, now seen corresponding path program 1 times [2025-01-09 15:20:04,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:20:04,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583727736] [2025-01-09 15:20:04,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:20:04,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:20:04,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:20:04,542 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:20:04,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2025-01-09 15:20:04,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:20:04,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:20:04,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:20:04,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:20:04,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 15:20:04,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:20:05,556 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-01-09 15:20:05,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:20:05,712 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:20:05,712 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:20:05,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583727736] [2025-01-09 15:20:05,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583727736] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:20:05,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:20:05,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-01-09 15:20:05,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773383241] [2025-01-09 15:20:05,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:20:05,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:20:05,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:20:05,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:20:05,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:20:05,713 INFO L87 Difference]: Start difference. First operand 675 states and 810 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:20:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:20:05,964 INFO L93 Difference]: Finished difference Result 1411 states and 1684 transitions. [2025-01-09 15:20:05,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:20:05,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-01-09 15:20:05,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:20:05,967 INFO L225 Difference]: With dead ends: 1411 [2025-01-09 15:20:05,967 INFO L226 Difference]: Without dead ends: 739 [2025-01-09 15:20:05,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:20:05,968 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 56 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:20:05,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 404 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:20:05,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-01-09 15:20:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 729. [2025-01-09 15:20:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 665 states have (on average 1.1548872180451129) internal successors, (768), 670 states have internal predecessors, (768), 48 states have call successors, (48), 15 states have call predecessors, (48), 15 states have return successors, (48), 43 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 15:20:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 864 transitions. [2025-01-09 15:20:06,008 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 864 transitions. Word has length 115 [2025-01-09 15:20:06,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:20:06,009 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 864 transitions. [2025-01-09 15:20:06,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:20:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 864 transitions. [2025-01-09 15:20:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:20:06,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:20:06,009 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:06,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2025-01-09 15:20:06,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:20:06,214 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:20:06,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:20:06,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1327850165, now seen corresponding path program 1 times [2025-01-09 15:20:06,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:20:06,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907423020] [2025-01-09 15:20:06,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:20:06,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:20:06,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:20:06,218 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:20:06,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2025-01-09 15:20:06,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:20:06,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:20:06,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:20:06,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:20:06,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 15:20:06,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:20:06,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:20:06,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 15:20:06,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:20:06,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2025-01-09 15:20:06,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:20:06,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 26 [2025-01-09 15:20:06,677 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-01-09 15:20:06,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:20:06,677 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:20:06,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907423020] [2025-01-09 15:20:06,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907423020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:20:06,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:20:06,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:20:06,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060323068] [2025-01-09 15:20:06,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:20:06,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:20:06,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:20:06,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:20:06,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:20:06,678 INFO L87 Difference]: Start difference. First operand 729 states and 864 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:20:07,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:20:07,050 INFO L93 Difference]: Finished difference Result 1695 states and 2018 transitions. [2025-01-09 15:20:07,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:20:07,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-01-09 15:20:07,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:20:07,054 INFO L225 Difference]: With dead ends: 1695 [2025-01-09 15:20:07,058 INFO L226 Difference]: Without dead ends: 1174 [2025-01-09 15:20:07,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:20:07,060 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 233 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:20:07,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 510 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:20:07,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2025-01-09 15:20:07,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1170. [2025-01-09 15:20:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1078 states have (on average 1.155844155844156) internal successors, (1246), 1087 states have internal predecessors, (1246), 68 states have call successors, (68), 23 states have call predecessors, (68), 23 states have return successors, (68), 59 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:20:07,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1382 transitions. [2025-01-09 15:20:07,136 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1382 transitions. Word has length 115 [2025-01-09 15:20:07,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:20:07,137 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1382 transitions. [2025-01-09 15:20:07,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:20:07,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1382 transitions. [2025-01-09 15:20:07,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:20:07,138 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:20:07,138 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:07,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2025-01-09 15:20:07,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:20:07,343 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:20:07,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:20:07,344 INFO L85 PathProgramCache]: Analyzing trace with hash -934823155, now seen corresponding path program 1 times [2025-01-09 15:20:07,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:20:07,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618603338] [2025-01-09 15:20:07,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:20:07,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:20:07,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:20:07,347 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:20:07,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2025-01-09 15:20:07,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:20:07,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:20:07,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:20:07,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:20:07,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 15:20:07,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:20:07,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:20:07,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 15:20:07,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2025-01-09 15:20:07,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:20:07,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 17 [2025-01-09 15:20:07,718 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:20:07,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:20:07,719 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:20:07,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618603338] [2025-01-09 15:20:07,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618603338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:20:07,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:20:07,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:20:07,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205338592] [2025-01-09 15:20:07,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:20:07,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:20:07,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:20:07,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:20:07,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:20:07,721 INFO L87 Difference]: Start difference. First operand 1170 states and 1382 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:20:08,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:20:08,099 INFO L93 Difference]: Finished difference Result 2447 states and 2912 transitions. [2025-01-09 15:20:08,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:20:08,100 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-01-09 15:20:08,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:20:08,104 INFO L225 Difference]: With dead ends: 2447 [2025-01-09 15:20:08,104 INFO L226 Difference]: Without dead ends: 1566 [2025-01-09 15:20:08,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:20:08,105 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 80 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:20:08,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1317 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:20:08,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2025-01-09 15:20:08,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1324. [2025-01-09 15:20:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1232 states have (on average 1.1623376623376624) internal successors, (1432), 1241 states have internal predecessors, (1432), 68 states have call successors, (68), 23 states have call predecessors, (68), 23 states have return successors, (68), 59 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:20:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1568 transitions. [2025-01-09 15:20:08,170 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1568 transitions. Word has length 115 [2025-01-09 15:20:08,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:20:08,170 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 1568 transitions. [2025-01-09 15:20:08,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:20:08,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1568 transitions. [2025-01-09 15:20:08,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:20:08,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:20:08,171 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:08,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2025-01-09 15:20:08,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:20:08,376 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:20:08,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:20:08,376 INFO L85 PathProgramCache]: Analyzing trace with hash 58353229, now seen corresponding path program 1 times [2025-01-09 15:20:08,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:20:08,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911586770] [2025-01-09 15:20:08,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:20:08,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:20:08,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:20:08,379 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:20:08,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2025-01-09 15:20:08,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:20:08,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:20:08,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:20:08,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:20:08,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 15:20:08,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:20:08,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 15:20:08,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-01-09 15:20:08,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:20:08,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 22 [2025-01-09 15:20:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-01-09 15:20:08,899 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:20:08,899 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:20:08,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911586770] [2025-01-09 15:20:08,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911586770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:20:08,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:20:08,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:20:08,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240148382] [2025-01-09 15:20:08,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:20:08,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:20:08,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:20:08,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:20:08,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:20:08,901 INFO L87 Difference]: Start difference. First operand 1324 states and 1568 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:20:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:20:09,682 INFO L93 Difference]: Finished difference Result 2644 states and 3145 transitions. [2025-01-09 15:20:09,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:20:09,686 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-01-09 15:20:09,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:20:09,689 INFO L225 Difference]: With dead ends: 2644 [2025-01-09 15:20:09,690 INFO L226 Difference]: Without dead ends: 1609 [2025-01-09 15:20:09,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:20:09,695 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 186 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:20:09,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1248 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:20:09,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2025-01-09 15:20:09,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1557. [2025-01-09 15:20:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1440 states have (on average 1.1631944444444444) internal successors, (1675), 1451 states have internal predecessors, (1675), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (86), 75 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 15:20:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 1847 transitions. [2025-01-09 15:20:09,845 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 1847 transitions. Word has length 115 [2025-01-09 15:20:09,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:20:09,847 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 1847 transitions. [2025-01-09 15:20:09,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:20:09,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1847 transitions. [2025-01-09 15:20:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:20:09,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:20:09,849 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:09,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0