./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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-49.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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '6499b62d1470f924cb4a1d4c6eb228c557a21b7be97bcd4aa73e963f3e1c7410'] 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-49.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 6499b62d1470f924cb4a1d4c6eb228c557a21b7be97bcd4aa73e963f3e1c7410 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:13:39,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:13:39,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:13:39,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:13:39,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:13:39,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:13:39,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:13:39,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:13:39,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:13:39,900 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:13:39,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:13:39,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:13:39,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:13:39,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:13:39,901 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:13:39,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:13:39,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:13:39,902 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:13:39,902 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:13:39,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:13:39,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:13:39,902 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:13:39,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:13:39,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:13:39,902 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:13:39,902 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:13:39,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:13:39,902 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:13:39,903 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:13:39,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:13:39,903 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:13:39,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:13:39,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:13:39,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:13:39,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:13:39,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:13:39,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:13:39,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:13:39,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:13:39,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:13:39,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:13:39,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:13:39,905 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 -> 6499b62d1470f924cb4a1d4c6eb228c557a21b7be97bcd4aa73e963f3e1c7410 [2024-11-07 10:13:40,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:13:40,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:13:40,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:13:40,152 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:13:40,152 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:13:40,153 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-49.i [2024-11-07 10:13:41,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:13:41,949 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:13:41,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-49.i [2024-11-07 10:13:41,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3fcaa246/bad7e12e6ae54bb08098307668942613/FLAGadf7db2bb [2024-11-07 10:13:42,265 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3fcaa246/bad7e12e6ae54bb08098307668942613 [2024-11-07 10:13:42,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:13:42,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:13:42,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:13:42,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:13:42,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:13:42,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:13:42" (1/1) ... [2024-11-07 10:13:42,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e879610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:42, skipping insertion in model container [2024-11-07 10:13:42,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:13:42" (1/1) ... [2024-11-07 10:13:42,292 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:13:42,399 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-49.i[916,929] [2024-11-07 10:13:42,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:13:42,489 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:13:42,499 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-49.i[916,929] [2024-11-07 10:13:42,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:13:42,549 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:13:42,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:42 WrapperNode [2024-11-07 10:13:42,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:13:42,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:13:42,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:13:42,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:13:42,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:42" (1/1) ... [2024-11-07 10:13:42,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:42" (1/1) ... [2024-11-07 10:13:42,611 INFO L138 Inliner]: procedures = 29, calls = 195, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 662 [2024-11-07 10:13:42,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:13:42,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:13:42,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:13:42,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:13:42,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:42" (1/1) ... [2024-11-07 10:13:42,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:42" (1/1) ... [2024-11-07 10:13:42,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:42" (1/1) ... [2024-11-07 10:13:42,664 INFO L175 MemorySlicer]: Split 166 memory accesses to 5 slices as follows [2, 34, 18, 19, 93]. 56 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 2, 2, 4]. The 17 writes are split as follows [0, 6, 2, 2, 7]. [2024-11-07 10:13:42,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:42" (1/1) ... [2024-11-07 10:13:42,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:42" (1/1) ... [2024-11-07 10:13:42,683 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:42" (1/1) ... [2024-11-07 10:13:42,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:42" (1/1) ... [2024-11-07 10:13:42,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:42" (1/1) ... [2024-11-07 10:13:42,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:42" (1/1) ... [2024-11-07 10:13:42,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:13:42,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:13:42,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:13:42,700 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:13:42,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:42" (1/1) ... [2024-11-07 10:13:42,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:13:42,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:13:42,740 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) [2024-11-07 10:13:42,745 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 [2024-11-07 10:13:42,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:13:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-07 10:13:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-07 10:13:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-07 10:13:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-07 10:13:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-07 10:13:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:13:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:13:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 10:13:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 10:13:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 10:13:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-07 10:13:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-07 10:13:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-07 10:13:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-07 10:13:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-07 10:13:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:13:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:13:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 10:13:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 10:13:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 10:13:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-07 10:13:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-07 10:13:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-07 10:13:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-07 10:13:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-07 10:13:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:13:42,774 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:13:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:13:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:13:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 10:13:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 10:13:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 10:13:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:13:42,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:13:42,918 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:13:42,919 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:13:43,511 INFO L? ?]: Removed 216 outVars from TransFormulas that were not future-live. [2024-11-07 10:13:43,511 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:13:43,523 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:13:43,523 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:13:43,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:13:43 BoogieIcfgContainer [2024-11-07 10:13:43,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:13:43,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:13:43,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:13:43,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:13:43,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:13:42" (1/3) ... [2024-11-07 10:13:43,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad59522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:13:43, skipping insertion in model container [2024-11-07 10:13:43,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:42" (2/3) ... [2024-11-07 10:13:43,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad59522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:13:43, skipping insertion in model container [2024-11-07 10:13:43,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:13:43" (3/3) ... [2024-11-07 10:13:43,532 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-49.i [2024-11-07 10:13:43,545 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:13:43,545 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:13:43,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:13:43,617 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;@7093307f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:13:43,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:13:43,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 119 states have (on average 1.4705882352941178) internal successors, (175), 120 states have internal predecessors, (175), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:13:43,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 10:13:43,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:43,633 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:43,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:43,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:43,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1655919171, now seen corresponding path program 1 times [2024-11-07 10:13:43,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:13:43,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668030345] [2024-11-07 10:13:43,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:43,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:13:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:43,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:13:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:43,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:13:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:43,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:13:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:43,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:13:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:43,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:13:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:43,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:13:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:43,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:13:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:43,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:13:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:43,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:13:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:43,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:13:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:43,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:13:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:43,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:13:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:43,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:13:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:43,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:13:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:44,000 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:13:44,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:13:44,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668030345] [2024-11-07 10:13:44,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668030345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:13:44,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:13:44,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:13:44,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617976508] [2024-11-07 10:13:44,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:13:44,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:13:44,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:13:44,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:13:44,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:13:44,023 INFO L87 Difference]: Start difference. First operand has 136 states, 119 states have (on average 1.4705882352941178) internal successors, (175), 120 states have internal predecessors, (175), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:13:44,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:44,049 INFO L93 Difference]: Finished difference Result 265 states and 414 transitions. [2024-11-07 10:13:44,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:13:44,050 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-11-07 10:13:44,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:44,055 INFO L225 Difference]: With dead ends: 265 [2024-11-07 10:13:44,055 INFO L226 Difference]: Without dead ends: 132 [2024-11-07 10:13:44,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:13:44,059 INFO L432 NwaCegarLoop]: 196 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, 196 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:44,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:13:44,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-07 10:13:44,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-07 10:13:44,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 116 states have (on average 1.4482758620689655) internal successors, (168), 116 states have internal predecessors, (168), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:13:44,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 196 transitions. [2024-11-07 10:13:44,090 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 196 transitions. Word has length 117 [2024-11-07 10:13:44,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:44,090 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 196 transitions. [2024-11-07 10:13:44,090 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:13:44,091 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 196 transitions. [2024-11-07 10:13:44,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 10:13:44,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:44,093 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:44,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:13:44,094 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:44,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:44,094 INFO L85 PathProgramCache]: Analyzing trace with hash -358103061, now seen corresponding path program 1 times [2024-11-07 10:13:44,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:13:44,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282526994] [2024-11-07 10:13:44,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:44,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:13:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:44,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:13:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:44,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:13:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:44,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:13:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:44,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:13:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:44,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:13:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:44,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:13:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:44,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:13:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:44,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:13:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:44,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:13:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:44,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:13:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:44,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:13:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:44,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:13:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:44,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:13:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:44,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:13:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:44,754 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:13:44,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:13:44,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282526994] [2024-11-07 10:13:44,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282526994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:13:44,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:13:44,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:13:44,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191055165] [2024-11-07 10:13:44,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:13:44,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:13:44,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:13:44,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:13:44,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:13:44,758 INFO L87 Difference]: Start difference. First operand 132 states and 196 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:13:45,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:45,062 INFO L93 Difference]: Finished difference Result 392 states and 585 transitions. [2024-11-07 10:13:45,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:13:45,062 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-11-07 10:13:45,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:45,064 INFO L225 Difference]: With dead ends: 392 [2024-11-07 10:13:45,064 INFO L226 Difference]: Without dead ends: 263 [2024-11-07 10:13:45,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:13:45,065 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 187 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:45,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 882 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:13:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-07 10:13:45,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 136. [2024-11-07 10:13:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 120 states have (on average 1.4416666666666667) internal successors, (173), 120 states have internal predecessors, (173), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:13:45,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 201 transitions. [2024-11-07 10:13:45,086 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 201 transitions. Word has length 117 [2024-11-07 10:13:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:45,089 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 201 transitions. [2024-11-07 10:13:45,090 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:13:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 201 transitions. [2024-11-07 10:13:45,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 10:13:45,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:45,091 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:45,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:13:45,091 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:45,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:45,091 INFO L85 PathProgramCache]: Analyzing trace with hash 132184262, now seen corresponding path program 1 times [2024-11-07 10:13:45,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:13:45,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147007354] [2024-11-07 10:13:45,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:45,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:13:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:45,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:13:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:45,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:13:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:45,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:13:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:45,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:13:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:45,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:13:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:45,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:13:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:45,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:13:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:45,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:13:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:45,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:13:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:45,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:13:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:45,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:13:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:45,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:13:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:45,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:13:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:45,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:13:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 10:13:45,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:13:45,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147007354] [2024-11-07 10:13:45,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147007354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:13:45,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662078345] [2024-11-07 10:13:45,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:45,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:13:45,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:13:45,885 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) [2024-11-07 10:13:45,887 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 [2024-11-07 10:13:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:46,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 10:13:46,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:13:46,151 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 76 treesize of output 55 [2024-11-07 10:13:46,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-07 10:13:46,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2024-11-07 10:13:46,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:13:46,435 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 [2024-11-07 10:13:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:13:46,527 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:13:46,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662078345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:13:46,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:13:46,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2024-11-07 10:13:46,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948724778] [2024-11-07 10:13:46,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:13:46,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:13:46,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:13:46,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:13:46,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:13:46,530 INFO L87 Difference]: Start difference. First operand 136 states and 201 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:13:46,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:46,764 INFO L93 Difference]: Finished difference Result 387 states and 574 transitions. [2024-11-07 10:13:46,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:13:46,765 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-07 10:13:46,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:46,766 INFO L225 Difference]: With dead ends: 387 [2024-11-07 10:13:46,766 INFO L226 Difference]: Without dead ends: 254 [2024-11-07 10:13:46,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:13:46,768 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 156 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:46,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1452 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:13:46,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-07 10:13:46,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2024-11-07 10:13:46,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 228 states have (on average 1.4605263157894737) internal successors, (333), 229 states have internal predecessors, (333), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:13:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 373 transitions. [2024-11-07 10:13:46,797 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 373 transitions. Word has length 119 [2024-11-07 10:13:46,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:46,798 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 373 transitions. [2024-11-07 10:13:46,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:13:46,798 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 373 transitions. [2024-11-07 10:13:46,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 10:13:46,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:46,800 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:46,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 10:13:47,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:13:47,002 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:47,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:47,002 INFO L85 PathProgramCache]: Analyzing trace with hash -260842748, now seen corresponding path program 1 times [2024-11-07 10:13:47,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:13:47,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310770440] [2024-11-07 10:13:47,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:47,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:13:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:47,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:13:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:47,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:13:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:47,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:13:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:47,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:13:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:47,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:13:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:47,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:13:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:47,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:13:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:47,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:13:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:47,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:13:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:47,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:13:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:47,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:13:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:47,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:13:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:47,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:13:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:47,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:13:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:13:47,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:13:47,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310770440] [2024-11-07 10:13:47,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310770440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:13:47,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:13:47,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:13:47,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613440106] [2024-11-07 10:13:47,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:13:47,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:13:47,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:13:47,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:13:47,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:13:47,342 INFO L87 Difference]: Start difference. First operand 251 states and 373 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:13:47,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:47,421 INFO L93 Difference]: Finished difference Result 528 states and 782 transitions. [2024-11-07 10:13:47,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:13:47,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-07 10:13:47,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:47,424 INFO L225 Difference]: With dead ends: 528 [2024-11-07 10:13:47,424 INFO L226 Difference]: Without dead ends: 280 [2024-11-07 10:13:47,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:13:47,425 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 154 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:47,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 694 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:13:47,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-07 10:13:47,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 250. [2024-11-07 10:13:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 227 states have (on average 1.4581497797356828) internal successors, (331), 228 states have internal predecessors, (331), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:13:47,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2024-11-07 10:13:47,441 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 119 [2024-11-07 10:13:47,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:47,441 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2024-11-07 10:13:47,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:13:47,442 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2024-11-07 10:13:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 10:13:47,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:47,443 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:47,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:13:47,443 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:47,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:47,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1402700193, now seen corresponding path program 1 times [2024-11-07 10:13:47,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:13:47,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913401699] [2024-11-07 10:13:47,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:47,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:13:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:48,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:13:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:48,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:13:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:48,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:13:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:48,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:13:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:48,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:13:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:48,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:13:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:48,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:13:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:48,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:13:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:48,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:13:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:48,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:13:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:48,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:13:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:48,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:13:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:48,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:13:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:48,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:13:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:48,299 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 10:13:48,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:13:48,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913401699] [2024-11-07 10:13:48,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913401699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:13:48,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182874417] [2024-11-07 10:13:48,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:48,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:13:48,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:13:48,303 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) [2024-11-07 10:13:48,317 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 [2024-11-07 10:13:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:48,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 10:13:48,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:13:48,649 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 29 treesize of output 13 [2024-11-07 10:13:49,051 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 68 treesize of output 50 [2024-11-07 10:13:49,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:13:49,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 80 [2024-11-07 10:13:49,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:13:49,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 35 treesize of output 40 [2024-11-07 10:13:49,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:13:49,165 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 70 treesize of output 34 [2024-11-07 10:13:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-07 10:13:49,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:13:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 10:13:49,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182874417] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:13:49,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 10:13:49,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 11 [2024-11-07 10:13:49,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276458125] [2024-11-07 10:13:49,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 10:13:49,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:13:49,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:13:49,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:13:49,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:13:49,540 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-07 10:13:50,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:50,060 INFO L93 Difference]: Finished difference Result 677 states and 1001 transitions. [2024-11-07 10:13:50,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 10:13:50,061 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) Word has length 119 [2024-11-07 10:13:50,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:50,064 INFO L225 Difference]: With dead ends: 677 [2024-11-07 10:13:50,064 INFO L226 Difference]: Without dead ends: 430 [2024-11-07 10:13:50,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 259 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2024-11-07 10:13:50,070 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 744 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:50,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 889 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:13:50,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-07 10:13:50,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 258. [2024-11-07 10:13:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 233 states have (on average 1.4377682403433476) internal successors, (335), 234 states have internal predecessors, (335), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:13:50,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 375 transitions. [2024-11-07 10:13:50,102 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 375 transitions. Word has length 119 [2024-11-07 10:13:50,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:50,102 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 375 transitions. [2024-11-07 10:13:50,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-07 10:13:50,103 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 375 transitions. [2024-11-07 10:13:50,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 10:13:50,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:50,104 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:50,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 10:13:50,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:13:50,307 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:50,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:50,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1086473895, now seen corresponding path program 1 times [2024-11-07 10:13:50,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:13:50,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633086757] [2024-11-07 10:13:50,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:50,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:13:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:50,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:13:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:50,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:13:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:50,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:13:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:50,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:13:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:50,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:13:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:50,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:13:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:50,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:13:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:50,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:13:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:50,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:13:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:50,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:13:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:50,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:13:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:50,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:13:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:50,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:13:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:50,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:13:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 10:13:50,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:13:50,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633086757] [2024-11-07 10:13:50,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633086757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:13:50,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129381972] [2024-11-07 10:13:50,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:50,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:13:50,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:13:50,912 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) [2024-11-07 10:13:50,916 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 [2024-11-07 10:13:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:51,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 10:13:51,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:13:51,369 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 70 treesize of output 52 [2024-11-07 10:13:51,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 70 [2024-11-07 10:13:51,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2024-11-07 10:13:51,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:13:51,426 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 40 treesize of output 36 [2024-11-07 10:13:51,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:13:51,476 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 45 treesize of output 15 [2024-11-07 10:13:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 106 proven. 66 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-07 10:13:51,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:13:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 10:13:51,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129381972] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:13:51,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 10:13:51,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 13 [2024-11-07 10:13:51,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455387877] [2024-11-07 10:13:51,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 10:13:51,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:13:51,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:13:51,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:13:51,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:13:51,784 INFO L87 Difference]: Start difference. First operand 258 states and 375 transitions. Second operand has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 13 states have internal predecessors, (72), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 4 states have call successors, (26) [2024-11-07 10:13:52,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:52,681 INFO L93 Difference]: Finished difference Result 1172 states and 1687 transitions. [2024-11-07 10:13:52,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-07 10:13:52,682 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 13 states have internal predecessors, (72), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 4 states have call successors, (26) Word has length 121 [2024-11-07 10:13:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:52,686 INFO L225 Difference]: With dead ends: 1172 [2024-11-07 10:13:52,686 INFO L226 Difference]: Without dead ends: 917 [2024-11-07 10:13:52,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 261 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=970, Unknown=0, NotChecked=0, Total=1260 [2024-11-07 10:13:52,689 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 1103 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:52,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 1309 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:13:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2024-11-07 10:13:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 274. [2024-11-07 10:13:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 247 states have (on average 1.4291497975708503) internal successors, (353), 248 states have internal predecessors, (353), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:13:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 393 transitions. [2024-11-07 10:13:52,720 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 393 transitions. Word has length 121 [2024-11-07 10:13:52,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:52,720 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 393 transitions. [2024-11-07 10:13:52,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 13 states have internal predecessors, (72), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 4 states have call successors, (26) [2024-11-07 10:13:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 393 transitions. [2024-11-07 10:13:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 10:13:52,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:52,722 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:52,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 10:13:52,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:13:52,923 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:52,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1673279909, now seen corresponding path program 1 times [2024-11-07 10:13:52,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:13:52,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958993323] [2024-11-07 10:13:52,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:52,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:13:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:13:52,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:13:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:13:53,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:13:53,142 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:13:53,143 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:13:53,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:13:53,150 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:53,240 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:13:53,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:13:53 BoogieIcfgContainer [2024-11-07 10:13:53,250 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:13:53,251 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:13:53,251 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:13:53,251 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:13:53,252 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:13:43" (3/4) ... [2024-11-07 10:13:53,254 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:13:53,258 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:13:53,259 INFO L158 Benchmark]: Toolchain (without parser) took 10989.05ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 91.6MB in the beginning and 84.1MB in the end (delta: 7.5MB). Peak memory consumption was 129.6MB. Max. memory is 16.1GB. [2024-11-07 10:13:53,259 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:13:53,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.40ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 73.3MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:13:53,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.63ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 68.2MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:13:53,259 INFO L158 Benchmark]: Boogie Preprocessor took 86.70ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 62.4MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:13:53,260 INFO L158 Benchmark]: RCFGBuilder took 824.57ms. Allocated memory is still 117.4MB. Free memory was 62.2MB in the beginning and 63.6MB in the end (delta: -1.4MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2024-11-07 10:13:53,260 INFO L158 Benchmark]: TraceAbstraction took 9724.30ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 63.2MB in the beginning and 86.8MB in the end (delta: -23.6MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. [2024-11-07 10:13:53,260 INFO L158 Benchmark]: Witness Printer took 7.14ms. Allocated memory is still 243.3MB. Free memory was 84.1MB in the beginning and 84.1MB in the end (delta: 60.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:13:53,265 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.26ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.40ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 73.3MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.63ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 68.2MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.70ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 62.4MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 824.57ms. Allocated memory is still 117.4MB. Free memory was 62.2MB in the beginning and 63.6MB in the end (delta: -1.4MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9724.30ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 63.2MB in the beginning and 86.8MB in the end (delta: -23.6MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. * Witness Printer took 7.14ms. Allocated memory is still 243.3MB. Free memory was 84.1MB in the beginning and 84.1MB in the end (delta: 60.1kB). 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 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L25-L27] float float_Array_0[2] = { 1000.2, 1000000000000000.4 }; [L25-L27] float float_Array_0[2] = { 1000.2, 1000000000000000.4 }; [L25-L27] float float_Array_0[2] = { 1000.2, 1000000000000000.4 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { -2, 128 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { -2, 128 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { -2, 128 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] FCALL updateLastVariables() [L99] CALL updateVariables() [L65] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] float_Array_0[0] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[0] [L72] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L72] EXPR float_Array_0[0] [L72] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+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, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] float_Array_0[1] = __VERIFIER_nondet_float() [L74] EXPR float_Array_0[1] [L74] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L74] EXPR float_Array_0[1] [L74] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+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, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L75] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L76] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32766) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] unsigned_short_int_Array_0[0][0] = __VERIFIER_nondet_ushort() [L79] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L82] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L85] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L99] RET updateVariables() [L100] CALL step() [L37] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L37] EXPR ((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]) [L37] EXPR signed_short_int_Array_0[0] [L37] EXPR ((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L37] signed_short_int_Array_0[1] = ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))) [L38] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L38] EXPR 50 >> unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L38] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L38] COND FALSE !((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) [L41] EXPR BOOL_unsigned_char_Array_0[1][1] [L41] BOOL_unsigned_char_Array_0[0][1] = (! BOOL_unsigned_char_Array_0[1][1]) [L43] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L43] COND TRUE ! BOOL_unsigned_char_Array_0[0][0] [L44] EXPR unsigned_short_int_Array_0[0][1] [L44] EXPR unsigned_short_int_Array_0[0][0] [L44] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L44] EXPR ((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1]) [L44] EXPR unsigned_short_int_Array_0[0][0] [L44] EXPR ((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L44] COND FALSE !(unsigned_short_int_Array_0[0][1] >= ((((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1])))) [L47] EXPR BOOL_unsigned_char_Array_0[1][1] [L47] BOOL_unsigned_char_Array_0[1][0] = BOOL_unsigned_char_Array_0[1][1] [L50] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L50] COND TRUE float_Array_0[1] >= 64.5f [L51] EXPR float_Array_0[1] [L51] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L51] COND FALSE !(float_Array_0[1] >= float_Array_0[0]) [L54] BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L54] COND FALSE !(BOOL_unsigned_char_Array_0[1][0]) [L57] EXPR unsigned_short_int_Array_0[0][0] [L57] unsigned_short_int_Array_0[1][1] = unsigned_short_int_Array_0[0][0] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR (float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50)) [L91] EXPR unsigned_short_int_Array_0[1][1] [L91] EXPR (float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR ((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR ((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR (((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0])))))) && (((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) ((! (! BOOL_unsigned_char_Array_0[1][1])) || BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR (((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0])))))) && (((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) ((! (! BOOL_unsigned_char_Array_0[1][1])) || BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR ((((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0])))))) && (((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) ((! (! BOOL_unsigned_char_Array_0[1][1])) || BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))))) && ((! BOOL_unsigned_char_Array_0[0][0]) ? ((unsigned_short_int_Array_0[0][1] >= ((((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR ((((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0])))))) && (((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) ((! (! BOOL_unsigned_char_Array_0[1][1])) || BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))))) && ((! BOOL_unsigned_char_Array_0[0][0]) ? ((unsigned_short_int_Array_0[0][1] >= ((((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91-L92] return ((((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0])))))) && (((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) ((! (! BOOL_unsigned_char_Array_0[1][1])) || BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))))) && ((! BOOL_unsigned_char_Array_0[0][0]) ? ((unsigned_short_int_Array_0[0][1] >= ((((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : 1) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 7, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2353 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2344 mSDsluCounter, 5422 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4196 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1406 IncrementalHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 1226 mSDtfsCounter, 1406 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 853 GetRequests, 770 SyntacticMatches, 11 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=6, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 975 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1192 NumberOfCodeBlocks, 1192 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1300 ConstructedInterpolants, 0 QuantifiedInterpolants, 5797 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1205 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 3734/4004 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 10:13:53,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-49.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 6499b62d1470f924cb4a1d4c6eb228c557a21b7be97bcd4aa73e963f3e1c7410 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:13:56,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:13:56,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 10:13:56,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:13:56,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:13:56,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:13:56,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:13:56,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:13:56,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:13:56,909 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:13:56,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:13:56,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:13:56,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:13:56,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:13:56,910 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:13:56,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:13:56,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:13:56,910 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:13:56,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:13:56,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:13:56,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:13:56,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:13:56,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:13:56,911 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:13:56,911 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:13:56,911 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:13:56,912 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:13:56,912 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:13:56,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:13:56,912 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:13:56,912 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:13:56,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:13:56,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:13:56,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:13:56,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:13:56,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:13:56,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:13:56,913 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:13:56,913 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:13:56,913 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:13:56,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:13:56,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:13:56,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:13:56,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:13:56,914 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 -> 6499b62d1470f924cb4a1d4c6eb228c557a21b7be97bcd4aa73e963f3e1c7410 [2024-11-07 10:13:57,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:13:57,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:13:57,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:13:57,244 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:13:57,244 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:13:57,247 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-49.i [2024-11-07 10:13:58,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:13:58,887 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:13:58,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-49.i [2024-11-07 10:13:58,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27a7ce2d7/915c66d802e7420a925f78ce6fcfd704/FLAG0df9e99ef [2024-11-07 10:13:59,207 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27a7ce2d7/915c66d802e7420a925f78ce6fcfd704 [2024-11-07 10:13:59,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:13:59,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:13:59,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:13:59,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:13:59,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:13:59,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:13:59" (1/1) ... [2024-11-07 10:13:59,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@388cc49c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:59, skipping insertion in model container [2024-11-07 10:13:59,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:13:59" (1/1) ... [2024-11-07 10:13:59,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:13:59,348 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-49.i[916,929] [2024-11-07 10:13:59,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:13:59,413 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:13:59,425 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-49.i[916,929] [2024-11-07 10:13:59,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:13:59,495 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:13:59,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:59 WrapperNode [2024-11-07 10:13:59,496 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:13:59,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:13:59,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:13:59,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:13:59,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:59" (1/1) ... [2024-11-07 10:13:59,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:59" (1/1) ... [2024-11-07 10:13:59,543 INFO L138 Inliner]: procedures = 33, calls = 195, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 647 [2024-11-07 10:13:59,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:13:59,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:13:59,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:13:59,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:13:59,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:59" (1/1) ... [2024-11-07 10:13:59,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:59" (1/1) ... [2024-11-07 10:13:59,555 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:59" (1/1) ... [2024-11-07 10:13:59,567 INFO L175 MemorySlicer]: Split 166 memory accesses to 5 slices as follows [2, 34, 18, 19, 93]. 56 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 2, 2, 4]. The 17 writes are split as follows [0, 6, 2, 2, 7]. [2024-11-07 10:13:59,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:59" (1/1) ... [2024-11-07 10:13:59,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:59" (1/1) ... [2024-11-07 10:13:59,584 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:59" (1/1) ... [2024-11-07 10:13:59,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:59" (1/1) ... [2024-11-07 10:13:59,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:59" (1/1) ... [2024-11-07 10:13:59,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:59" (1/1) ... [2024-11-07 10:13:59,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:13:59,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:13:59,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:13:59,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:13:59,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:59" (1/1) ... [2024-11-07 10:13:59,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:13:59,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:13:59,628 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) [2024-11-07 10:13:59,643 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 [2024-11-07 10:13:59,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:13:59,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:13:59,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:13:59,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 10:13:59,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-07 10:13:59,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-07 10:13:59,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-07 10:13:59,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-07 10:13:59,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-07 10:13:59,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-07 10:13:59,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-07 10:13:59,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:13:59,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:13:59,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 10:13:59,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 10:13:59,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-07 10:13:59,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:13:59,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:13:59,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-07 10:13:59,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-07 10:13:59,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-07 10:13:59,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:13:59,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:13:59,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-07 10:13:59,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-07 10:13:59,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-07 10:13:59,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:13:59,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:13:59,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-07 10:13:59,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-07 10:13:59,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-07 10:13:59,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-07 10:13:59,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-07 10:13:59,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-07 10:13:59,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-07 10:13:59,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-07 10:13:59,659 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:13:59,659 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:13:59,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:13:59,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:13:59,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:13:59,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:13:59,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-07 10:13:59,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-07 10:13:59,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-07 10:13:59,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:13:59,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:13:59,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-07 10:13:59,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-07 10:13:59,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-07 10:13:59,813 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:13:59,815 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:14:00,319 INFO L? ?]: Removed 212 outVars from TransFormulas that were not future-live. [2024-11-07 10:14:00,319 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:14:00,350 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:14:00,350 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:14:00,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:14:00 BoogieIcfgContainer [2024-11-07 10:14:00,351 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:14:00,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:14:00,352 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:14:00,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:14:00,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:13:59" (1/3) ... [2024-11-07 10:14:00,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7b1c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:14:00, skipping insertion in model container [2024-11-07 10:14:00,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:59" (2/3) ... [2024-11-07 10:14:00,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7b1c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:14:00, skipping insertion in model container [2024-11-07 10:14:00,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:14:00" (3/3) ... [2024-11-07 10:14:00,358 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-49.i [2024-11-07 10:14:00,370 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:14:00,371 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:14:00,419 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:14:00,430 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;@1e4f8d63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:14:00,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:14:00,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 113 states have (on average 1.4778761061946903) internal successors, (167), 114 states have internal predecessors, (167), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:14:00,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:14:00,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:00,447 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:00,447 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:00,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:00,452 INFO L85 PathProgramCache]: Analyzing trace with hash -705705352, now seen corresponding path program 1 times [2024-11-07 10:14:00,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:00,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556116480] [2024-11-07 10:14:00,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:00,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:00,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:00,465 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) [2024-11-07 10:14:00,466 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 [2024-11-07 10:14:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:00,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:14:00,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-07 10:14:00,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:00,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:00,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556116480] [2024-11-07 10:14:00,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556116480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:00,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:00,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:14:00,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257429790] [2024-11-07 10:14:00,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:00,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:14:00,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:00,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:14:00,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:14:00,968 INFO L87 Difference]: Start difference. First operand has 130 states, 113 states have (on average 1.4778761061946903) internal successors, (167), 114 states have internal predecessors, (167), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:14:01,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:01,013 INFO L93 Difference]: Finished difference Result 253 states and 398 transitions. [2024-11-07 10:14:01,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:14:01,015 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2024-11-07 10:14:01,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:01,023 INFO L225 Difference]: With dead ends: 253 [2024-11-07 10:14:01,028 INFO L226 Difference]: Without dead ends: 126 [2024-11-07 10:14:01,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:14:01,037 INFO L432 NwaCegarLoop]: 188 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, 188 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:01,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:14:01,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-07 10:14:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-07 10:14:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 110 states have (on average 1.4545454545454546) internal successors, (160), 110 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:14:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2024-11-07 10:14:01,104 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 115 [2024-11-07 10:14:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:01,106 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2024-11-07 10:14:01,106 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:14:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2024-11-07 10:14:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:14:01,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:01,109 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:01,117 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 (2)] Ended with exit code 0 [2024-11-07 10:14:01,314 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 [2024-11-07 10:14:01,315 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:01,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:01,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1616218656, now seen corresponding path program 1 times [2024-11-07 10:14:01,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:01,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602529044] [2024-11-07 10:14:01,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:01,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:01,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:01,324 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) [2024-11-07 10:14:01,327 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 [2024-11-07 10:14:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:01,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 10:14:01,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:01,638 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 [2024-11-07 10:14:01,684 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 25 [2024-11-07 10:14:01,706 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:14:01,706 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:01,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:01,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602529044] [2024-11-07 10:14:01,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602529044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:01,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:01,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:14:01,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913833465] [2024-11-07 10:14:01,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:01,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:14:01,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:01,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:14:01,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:14:01,709 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:02,293 INFO L93 Difference]: Finished difference Result 374 states and 561 transitions. [2024-11-07 10:14:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:14:02,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-07 10:14:02,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:02,296 INFO L225 Difference]: With dead ends: 374 [2024-11-07 10:14:02,296 INFO L226 Difference]: Without dead ends: 251 [2024-11-07 10:14:02,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:14:02,297 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 179 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:02,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 838 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:14:02,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-07 10:14:02,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 130. [2024-11-07 10:14:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 114 states have (on average 1.4473684210526316) internal successors, (165), 114 states have internal predecessors, (165), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:14:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 193 transitions. [2024-11-07 10:14:02,310 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 193 transitions. Word has length 115 [2024-11-07 10:14:02,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:02,311 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 193 transitions. [2024-11-07 10:14:02,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:02,312 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 193 transitions. [2024-11-07 10:14:02,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 10:14:02,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:02,314 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:02,322 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 [2024-11-07 10:14:02,517 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 [2024-11-07 10:14:02,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:02,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:02,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1437344069, now seen corresponding path program 1 times [2024-11-07 10:14:02,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:02,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267817983] [2024-11-07 10:14:02,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:02,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:02,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:02,523 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) [2024-11-07 10:14:02,525 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 [2024-11-07 10:14:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:02,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 10:14:02,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:02,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:14:02,853 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 29 treesize of output 13 [2024-11-07 10:14:02,994 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 29 treesize of output 13 [2024-11-07 10:14:03,000 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 [2024-11-07 10:14:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-07 10:14:03,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:14:03,233 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 10:14:03,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:03,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267817983] [2024-11-07 10:14:03,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267817983] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:14:03,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:14:03,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-07 10:14:03,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922156416] [2024-11-07 10:14:03,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:14:03,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:14:03,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:03,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:14:03,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:14:03,235 INFO L87 Difference]: Start difference. First operand 130 states and 193 transitions. Second operand has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-07 10:14:03,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:03,499 INFO L93 Difference]: Finished difference Result 265 states and 390 transitions. [2024-11-07 10:14:03,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 10:14:03,500 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) Word has length 117 [2024-11-07 10:14:03,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:03,501 INFO L225 Difference]: With dead ends: 265 [2024-11-07 10:14:03,501 INFO L226 Difference]: Without dead ends: 138 [2024-11-07 10:14:03,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:14:03,502 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 382 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:03,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 702 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:14:03,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-07 10:14:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 134. [2024-11-07 10:14:03,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 117 states have internal predecessors, (167), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:14:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 195 transitions. [2024-11-07 10:14:03,520 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 195 transitions. Word has length 117 [2024-11-07 10:14:03,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:03,521 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 195 transitions. [2024-11-07 10:14:03,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-07 10:14:03,521 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 195 transitions. [2024-11-07 10:14:03,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 10:14:03,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:03,522 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:03,531 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 [2024-11-07 10:14:03,722 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 [2024-11-07 10:14:03,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:03,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash -851948171, now seen corresponding path program 1 times [2024-11-07 10:14:03,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:03,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209553492] [2024-11-07 10:14:03,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:03,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:03,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:03,726 INFO L229 MonitoredProcess]: Starting monitored process 5 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) [2024-11-07 10:14:03,728 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 (5)] Waiting until timeout for monitored process [2024-11-07 10:14:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:04,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 10:14:04,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:04,033 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 [2024-11-07 10:14:04,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2024-11-07 10:14:04,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:04,547 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 74 treesize of output 38 [2024-11-07 10:14:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-07 10:14:04,674 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:04,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:04,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209553492] [2024-11-07 10:14:04,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209553492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:04,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:04,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 10:14:04,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508694298] [2024-11-07 10:14:04,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:04,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:14:04,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:04,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:14:04,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:14:04,676 INFO L87 Difference]: Start difference. First operand 134 states and 195 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:14:06,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:06,068 INFO L93 Difference]: Finished difference Result 485 states and 708 transitions. [2024-11-07 10:14:06,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 10:14:06,070 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-11-07 10:14:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:06,072 INFO L225 Difference]: With dead ends: 485 [2024-11-07 10:14:06,073 INFO L226 Difference]: Without dead ends: 354 [2024-11-07 10:14:06,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:14:06,074 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 658 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:06,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1937 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 10:14:06,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-07 10:14:06,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 297. [2024-11-07 10:14:06,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 272 states have (on average 1.474264705882353) internal successors, (401), 273 states have internal predecessors, (401), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:14:06,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 441 transitions. [2024-11-07 10:14:06,109 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 441 transitions. Word has length 119 [2024-11-07 10:14:06,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:06,109 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 441 transitions. [2024-11-07 10:14:06,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:14:06,109 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 441 transitions. [2024-11-07 10:14:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 10:14:06,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:06,114 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:06,122 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 (5)] Ended with exit code 0 [2024-11-07 10:14:06,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 [2024-11-07 10:14:06,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:06,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:06,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1244975181, now seen corresponding path program 1 times [2024-11-07 10:14:06,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:06,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774707650] [2024-11-07 10:14:06,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:06,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:06,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:06,319 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) [2024-11-07 10:14:06,320 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 [2024-11-07 10:14:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:06,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:14:06,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:06,565 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 [2024-11-07 10:14:06,585 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 25 treesize of output 24 [2024-11-07 10:14:06,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:06,664 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 29 treesize of output 15 [2024-11-07 10:14:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:14:06,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:06,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:06,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774707650] [2024-11-07 10:14:06,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [774707650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:06,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:06,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:14:06,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698180926] [2024-11-07 10:14:06,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:06,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:14:06,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:06,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:14:06,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:14:06,679 INFO L87 Difference]: Start difference. First operand 297 states and 441 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:06,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:06,802 INFO L93 Difference]: Finished difference Result 702 states and 1041 transitions. [2024-11-07 10:14:06,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:14:06,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-07 10:14:06,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:06,813 INFO L225 Difference]: With dead ends: 702 [2024-11-07 10:14:06,813 INFO L226 Difference]: Without dead ends: 408 [2024-11-07 10:14:06,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:14:06,814 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 280 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:06,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 677 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:14:06,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-07 10:14:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 302. [2024-11-07 10:14:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 277 states have (on average 1.4657039711191335) internal successors, (406), 278 states have internal predecessors, (406), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:14:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 446 transitions. [2024-11-07 10:14:06,831 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 446 transitions. Word has length 119 [2024-11-07 10:14:06,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:06,831 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 446 transitions. [2024-11-07 10:14:06,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:06,831 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 446 transitions. [2024-11-07 10:14:06,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 10:14:06,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:06,832 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:06,840 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 [2024-11-07 10:14:07,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 [2024-11-07 10:14:07,033 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:07,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:07,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1908134670, now seen corresponding path program 1 times [2024-11-07 10:14:07,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:07,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550755295] [2024-11-07 10:14:07,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:07,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:07,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:07,037 INFO L229 MonitoredProcess]: Starting monitored process 7 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) [2024-11-07 10:14:07,038 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 (7)] Waiting until timeout for monitored process [2024-11-07 10:14:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:07,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 10:14:07,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:07,687 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 58 treesize of output 22 [2024-11-07 10:14:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-07 10:14:07,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:07,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:07,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550755295] [2024-11-07 10:14:07,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [550755295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:07,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:07,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:14:07,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877522114] [2024-11-07 10:14:07,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:07,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:14:07,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:07,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:14:07,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:14:07,724 INFO L87 Difference]: Start difference. First operand 302 states and 446 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:14:08,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:08,221 INFO L93 Difference]: Finished difference Result 834 states and 1223 transitions. [2024-11-07 10:14:08,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:14:08,223 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), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-11-07 10:14:08,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:08,225 INFO L225 Difference]: With dead ends: 834 [2024-11-07 10:14:08,225 INFO L226 Difference]: Without dead ends: 535 [2024-11-07 10:14:08,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:14:08,227 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 348 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:08,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 790 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:14:08,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-07 10:14:08,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 531. [2024-11-07 10:14:08,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 482 states have (on average 1.4398340248962656) internal successors, (694), 486 states have internal predecessors, (694), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:14:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 774 transitions. [2024-11-07 10:14:08,257 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 774 transitions. Word has length 119 [2024-11-07 10:14:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:08,258 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 774 transitions. [2024-11-07 10:14:08,258 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), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:14:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 774 transitions. [2024-11-07 10:14:08,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 10:14:08,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:08,261 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:08,270 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 (7)] Forceful destruction successful, exit code 0 [2024-11-07 10:14:08,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 [2024-11-07 10:14:08,462 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:08,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:08,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1448874419, now seen corresponding path program 1 times [2024-11-07 10:14:08,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:08,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447640868] [2024-11-07 10:14:08,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:08,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:08,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:08,470 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) [2024-11-07 10:14:08,475 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 [2024-11-07 10:14:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:08,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 10:14:08,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:08,733 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 [2024-11-07 10:14:08,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2024-11-07 10:14:09,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:09,105 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 67 treesize of output 35 [2024-11-07 10:14:09,236 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:14:09,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:09,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:09,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447640868] [2024-11-07 10:14:09,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447640868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:09,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:09,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 10:14:09,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765697030] [2024-11-07 10:14:09,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:09,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:14:09,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:09,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:14:09,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:14:09,238 INFO L87 Difference]: Start difference. First operand 531 states and 774 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:10,192 INFO L93 Difference]: Finished difference Result 1429 states and 2075 transitions. [2024-11-07 10:14:10,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 10:14:10,197 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-07 10:14:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:10,201 INFO L225 Difference]: With dead ends: 1429 [2024-11-07 10:14:10,202 INFO L226 Difference]: Without dead ends: 901 [2024-11-07 10:14:10,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:14:10,203 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 283 mSDsluCounter, 2897 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 3264 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:10,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 3264 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:14:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2024-11-07 10:14:10,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 533. [2024-11-07 10:14:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 484 states have (on average 1.4421487603305785) internal successors, (698), 488 states have internal predecessors, (698), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:14:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 778 transitions. [2024-11-07 10:14:10,241 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 778 transitions. Word has length 119 [2024-11-07 10:14:10,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:10,241 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 778 transitions. [2024-11-07 10:14:10,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 778 transitions. [2024-11-07 10:14:10,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 10:14:10,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:10,245 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:10,253 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 (8)] Forceful destruction successful, exit code 0 [2024-11-07 10:14:10,449 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 [2024-11-07 10:14:10,449 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:10,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:10,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1637580791, now seen corresponding path program 1 times [2024-11-07 10:14:10,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:10,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7605215] [2024-11-07 10:14:10,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:10,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:10,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:10,454 INFO L229 MonitoredProcess]: Starting monitored process 9 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) [2024-11-07 10:14:10,456 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 (9)] Waiting until timeout for monitored process [2024-11-07 10:14:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:10,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:14:10,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:10,794 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 [2024-11-07 10:14:10,938 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 29 [2024-11-07 10:14:11,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:11,020 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 38 treesize of output 20 [2024-11-07 10:14:11,032 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-07 10:14:11,032 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:11,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:11,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7605215] [2024-11-07 10:14:11,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7605215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:11,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:11,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:14:11,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935141303] [2024-11-07 10:14:11,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:11,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:14:11,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:11,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:14:11,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:14:11,033 INFO L87 Difference]: Start difference. First operand 533 states and 778 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:14:11,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:11,281 INFO L93 Difference]: Finished difference Result 1075 states and 1562 transitions. [2024-11-07 10:14:11,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:14:11,282 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), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-11-07 10:14:11,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:11,284 INFO L225 Difference]: With dead ends: 1075 [2024-11-07 10:14:11,284 INFO L226 Difference]: Without dead ends: 545 [2024-11-07 10:14:11,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:14:11,286 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 430 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:11,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1000 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:14:11,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-07 10:14:11,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 443. [2024-11-07 10:14:11,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 408 states have (on average 1.4509803921568627) internal successors, (592), 409 states have internal predecessors, (592), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 10:14:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 648 transitions. [2024-11-07 10:14:11,315 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 648 transitions. Word has length 119 [2024-11-07 10:14:11,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:11,315 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 648 transitions. [2024-11-07 10:14:11,315 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), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:14:11,316 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 648 transitions. [2024-11-07 10:14:11,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 10:14:11,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:11,318 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:11,327 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 (9)] Ended with exit code 0 [2024-11-07 10:14:11,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 [2024-11-07 10:14:11,523 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:11,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:11,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1244553781, now seen corresponding path program 1 times [2024-11-07 10:14:11,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:11,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240280401] [2024-11-07 10:14:11,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:11,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:11,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:11,526 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) [2024-11-07 10:14:11,528 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 [2024-11-07 10:14:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:11,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 10:14:11,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:11,840 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 [2024-11-07 10:14:11,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2024-11-07 10:14:12,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:12,075 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 62 treesize of output 32 [2024-11-07 10:14:12,168 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:14:12,169 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:12,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:12,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240280401] [2024-11-07 10:14:12,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240280401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:12,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:12,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:14:12,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241412997] [2024-11-07 10:14:12,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:12,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:14:12,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:12,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:14:12,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:14:12,173 INFO L87 Difference]: Start difference. First operand 443 states and 648 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:12,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:12,715 INFO L93 Difference]: Finished difference Result 1079 states and 1574 transitions. [2024-11-07 10:14:12,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:14:12,716 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-07 10:14:12,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:12,719 INFO L225 Difference]: With dead ends: 1079 [2024-11-07 10:14:12,719 INFO L226 Difference]: Without dead ends: 639 [2024-11-07 10:14:12,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:14:12,721 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 142 mSDsluCounter, 2125 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 2449 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:12,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 2449 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:14:12,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-07 10:14:12,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 533. [2024-11-07 10:14:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 498 states have (on average 1.465863453815261) internal successors, (730), 499 states have internal predecessors, (730), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 10:14:12,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 786 transitions. [2024-11-07 10:14:12,760 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 786 transitions. Word has length 119 [2024-11-07 10:14:12,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:12,761 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 786 transitions. [2024-11-07 10:14:12,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:12,761 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 786 transitions. [2024-11-07 10:14:12,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 10:14:12,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:12,763 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:12,773 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 (10)] Forceful destruction successful, exit code 0 [2024-11-07 10:14:12,964 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 [2024-11-07 10:14:12,965 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:12,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:12,965 INFO L85 PathProgramCache]: Analyzing trace with hash 850296592, now seen corresponding path program 1 times [2024-11-07 10:14:12,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:12,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581413763] [2024-11-07 10:14:12,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:12,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:12,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:12,968 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) [2024-11-07 10:14:12,972 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 [2024-11-07 10:14:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:13,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:14:13,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-07 10:14:13,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:13,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:13,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581413763] [2024-11-07 10:14:13,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581413763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:13,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:13,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:14:13,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819633119] [2024-11-07 10:14:13,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:13,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:14:13,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:13,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:14:13,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:14:13,228 INFO L87 Difference]: Start difference. First operand 533 states and 786 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:14:13,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:13,270 INFO L93 Difference]: Finished difference Result 1063 states and 1569 transitions. [2024-11-07 10:14:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:14:13,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-11-07 10:14:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:13,274 INFO L225 Difference]: With dead ends: 1063 [2024-11-07 10:14:13,274 INFO L226 Difference]: Without dead ends: 533 [2024-11-07 10:14:13,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:14:13,275 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:13,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 547 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:14:13,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-07 10:14:13,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2024-11-07 10:14:13,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 498 states have (on average 1.463855421686747) internal successors, (729), 499 states have internal predecessors, (729), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 10:14:13,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 785 transitions. [2024-11-07 10:14:13,297 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 785 transitions. Word has length 119 [2024-11-07 10:14:13,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:13,298 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 785 transitions. [2024-11-07 10:14:13,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:14:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 785 transitions. [2024-11-07 10:14:13,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 10:14:13,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:13,299 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:13,314 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 [2024-11-07 10:14:13,502 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 [2024-11-07 10:14:13,502 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:13,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:13,503 INFO L85 PathProgramCache]: Analyzing trace with hash 578744404, now seen corresponding path program 1 times [2024-11-07 10:14:13,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:13,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652038296] [2024-11-07 10:14:13,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:13,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:13,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:13,506 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) [2024-11-07 10:14:13,508 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 [2024-11-07 10:14:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:13,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 10:14:13,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:13,900 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 57 treesize of output 21 [2024-11-07 10:14:13,921 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:14:13,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:13,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:13,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652038296] [2024-11-07 10:14:13,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652038296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:13,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:13,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:14:13,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15932232] [2024-11-07 10:14:13,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:13,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:14:13,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:13,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:14:13,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:14:13,923 INFO L87 Difference]: Start difference. First operand 533 states and 785 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:14,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:14,195 INFO L93 Difference]: Finished difference Result 1205 states and 1775 transitions. [2024-11-07 10:14:14,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:14:14,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-11-07 10:14:14,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:14,198 INFO L225 Difference]: With dead ends: 1205 [2024-11-07 10:14:14,198 INFO L226 Difference]: Without dead ends: 675 [2024-11-07 10:14:14,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:14:14,199 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 214 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:14,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 772 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:14:14,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-11-07 10:14:14,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 672. [2024-11-07 10:14:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 630 states have (on average 1.4619047619047618) internal successors, (921), 632 states have internal predecessors, (921), 33 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 10:14:14,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 987 transitions. [2024-11-07 10:14:14,220 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 987 transitions. Word has length 121 [2024-11-07 10:14:14,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:14,220 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 987 transitions. [2024-11-07 10:14:14,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 987 transitions. [2024-11-07 10:14:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 10:14:14,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:14,222 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:14,229 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 (12)] Forceful destruction successful, exit code 0 [2024-11-07 10:14:14,422 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 [2024-11-07 10:14:14,422 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:14,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:14,423 INFO L85 PathProgramCache]: Analyzing trace with hash 912621421, now seen corresponding path program 1 times [2024-11-07 10:14:14,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:14,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324269171] [2024-11-07 10:14:14,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:14,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:14,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:14,427 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) [2024-11-07 10:14:14,429 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 [2024-11-07 10:14:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:14,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 10:14:14,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:15,105 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 58 treesize of output 22 [2024-11-07 10:14:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-07 10:14:15,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:15,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:15,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324269171] [2024-11-07 10:14:15,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324269171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:15,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:15,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:14:15,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679830520] [2024-11-07 10:14:15,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:15,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:14:15,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:15,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:14:15,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:14:15,134 INFO L87 Difference]: Start difference. First operand 672 states and 987 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:14:15,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:15,683 INFO L93 Difference]: Finished difference Result 1256 states and 1833 transitions. [2024-11-07 10:14:15,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:14:15,683 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2024-11-07 10:14:15,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:15,687 INFO L225 Difference]: With dead ends: 1256 [2024-11-07 10:14:15,688 INFO L226 Difference]: Without dead ends: 587 [2024-11-07 10:14:15,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:14:15,689 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 230 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:15,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 788 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:14:15,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-11-07 10:14:15,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 584. [2024-11-07 10:14:15,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 542 states have (on average 1.433579335793358) internal successors, (777), 544 states have internal predecessors, (777), 33 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 10:14:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 843 transitions. [2024-11-07 10:14:15,739 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 843 transitions. Word has length 121 [2024-11-07 10:14:15,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:15,741 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 843 transitions. [2024-11-07 10:14:15,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:14:15,741 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 843 transitions. [2024-11-07 10:14:15,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 10:14:15,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:15,743 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:15,762 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 [2024-11-07 10:14:15,943 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 [2024-11-07 10:14:15,943 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:15,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:15,944 INFO L85 PathProgramCache]: Analyzing trace with hash 36513319, now seen corresponding path program 1 times [2024-11-07 10:14:15,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:15,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138938530] [2024-11-07 10:14:15,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:15,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:15,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:15,946 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) [2024-11-07 10:14:15,947 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 [2024-11-07 10:14:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:16,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 10:14:16,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:16,300 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 [2024-11-07 10:14:16,741 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 85 treesize of output 51 [2024-11-07 10:14:16,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:16,821 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 42 treesize of output 38 [2024-11-07 10:14:17,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:17,046 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 126 treesize of output 66 [2024-11-07 10:14:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 149 proven. 30 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-11-07 10:14:17,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:14:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:14:17,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:17,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138938530] [2024-11-07 10:14:17,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138938530] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:14:17,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:14:17,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 14 [2024-11-07 10:14:17,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957042663] [2024-11-07 10:14:17,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:17,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:14:17,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:17,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:14:17,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:14:17,399 INFO L87 Difference]: Start difference. First operand 584 states and 843 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:17,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:17,656 INFO L93 Difference]: Finished difference Result 1349 states and 1941 transitions. [2024-11-07 10:14:17,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:14:17,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-11-07 10:14:17,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:17,660 INFO L225 Difference]: With dead ends: 1349 [2024-11-07 10:14:17,661 INFO L226 Difference]: Without dead ends: 768 [2024-11-07 10:14:17,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:14:17,662 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 109 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:17,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 865 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:14:17,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-07 10:14:17,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 688. [2024-11-07 10:14:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 646 states have (on average 1.438080495356037) internal successors, (929), 648 states have internal predecessors, (929), 33 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 10:14:17,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 995 transitions. [2024-11-07 10:14:17,705 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 995 transitions. Word has length 121 [2024-11-07 10:14:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:17,706 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 995 transitions. [2024-11-07 10:14:17,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 995 transitions. [2024-11-07 10:14:17,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 10:14:17,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:17,708 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:17,718 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 [2024-11-07 10:14:17,908 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 [2024-11-07 10:14:17,908 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:17,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:17,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2083950962, now seen corresponding path program 1 times [2024-11-07 10:14:17,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:17,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510955525] [2024-11-07 10:14:17,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:17,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:17,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:17,913 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) [2024-11-07 10:14:17,914 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 [2024-11-07 10:14:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:18,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 10:14:18,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:18,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 15 treesize of output 1 [2024-11-07 10:14:18,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2024-11-07 10:14:18,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-07 10:14:18,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:18,983 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 86 treesize of output 46 [2024-11-07 10:14:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 193 proven. 21 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-07 10:14:19,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:14:19,527 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 22 [2024-11-07 10:14:19,642 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:14:19,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:19,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510955525] [2024-11-07 10:14:19,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510955525] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:14:19,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:14:19,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17] total 25 [2024-11-07 10:14:19,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370255053] [2024-11-07 10:14:19,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:19,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:14:19,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:19,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:14:19,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2024-11-07 10:14:19,644 INFO L87 Difference]: Start difference. First operand 688 states and 995 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:21,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:21,008 INFO L93 Difference]: Finished difference Result 1686 states and 2398 transitions. [2024-11-07 10:14:21,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 10:14:21,008 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-11-07 10:14:21,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:21,011 INFO L225 Difference]: With dead ends: 1686 [2024-11-07 10:14:21,011 INFO L226 Difference]: Without dead ends: 1001 [2024-11-07 10:14:21,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2024-11-07 10:14:21,013 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 417 mSDsluCounter, 1907 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 2213 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:21,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 2213 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 10:14:21,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-11-07 10:14:21,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 598. [2024-11-07 10:14:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 556 states have (on average 1.4280575539568345) internal successors, (794), 558 states have internal predecessors, (794), 33 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 10:14:21,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 860 transitions. [2024-11-07 10:14:21,042 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 860 transitions. Word has length 121 [2024-11-07 10:14:21,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:21,042 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 860 transitions. [2024-11-07 10:14:21,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:21,043 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 860 transitions. [2024-11-07 10:14:21,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 10:14:21,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:21,044 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:21,051 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 [2024-11-07 10:14:21,247 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 [2024-11-07 10:14:21,248 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:21,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:21,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1680529936, now seen corresponding path program 1 times [2024-11-07 10:14:21,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:21,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103315220] [2024-11-07 10:14:21,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:21,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:21,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:21,252 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) [2024-11-07 10:14:21,254 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 [2024-11-07 10:14:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:21,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 10:14:21,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:21,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-07 10:14:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-07 10:14:21,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:14:21,834 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 10:14:21,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:21,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103315220] [2024-11-07 10:14:21,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103315220] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:14:21,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:14:21,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-11-07 10:14:21,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043915802] [2024-11-07 10:14:21,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:14:21,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:14:21,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:21,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:14:21,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:14:21,835 INFO L87 Difference]: Start difference. First operand 598 states and 860 transitions. Second operand has 10 states, 8 states have (on average 8.0) internal successors, (64), 10 states have internal predecessors, (64), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-07 10:14:22,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:22,094 INFO L93 Difference]: Finished difference Result 1221 states and 1742 transitions. [2024-11-07 10:14:22,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 10:14:22,095 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.0) internal successors, (64), 10 states have internal predecessors, (64), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 121 [2024-11-07 10:14:22,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:22,097 INFO L225 Difference]: With dead ends: 1221 [2024-11-07 10:14:22,097 INFO L226 Difference]: Without dead ends: 626 [2024-11-07 10:14:22,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:14:22,107 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 258 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:22,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 699 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:14:22,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-11-07 10:14:22,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 610. [2024-11-07 10:14:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 565 states have (on average 1.4141592920353983) internal successors, (799), 567 states have internal predecessors, (799), 33 states have call successors, (33), 11 states have call predecessors, (33), 11 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 10:14:22,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 865 transitions. [2024-11-07 10:14:22,136 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 865 transitions. Word has length 121 [2024-11-07 10:14:22,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:22,137 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 865 transitions. [2024-11-07 10:14:22,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.0) internal successors, (64), 10 states have internal predecessors, (64), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-07 10:14:22,137 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 865 transitions. [2024-11-07 10:14:22,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 10:14:22,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:22,139 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:22,149 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 [2024-11-07 10:14:22,339 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 [2024-11-07 10:14:22,340 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:22,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:22,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1461675218, now seen corresponding path program 1 times [2024-11-07 10:14:22,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:22,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637190317] [2024-11-07 10:14:22,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:22,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:22,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:22,343 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) [2024-11-07 10:14:22,345 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 [2024-11-07 10:14:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:22,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 10:14:22,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:22,626 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 [2024-11-07 10:14:22,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2024-11-07 10:14:22,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:22,883 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 58 treesize of output 32 [2024-11-07 10:14:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-07 10:14:22,956 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:22,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:22,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637190317] [2024-11-07 10:14:22,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637190317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:22,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:22,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:14:22,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031905042] [2024-11-07 10:14:22,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:22,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:14:22,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:22,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:14:22,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:14:22,958 INFO L87 Difference]: Start difference. First operand 610 states and 865 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:14:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:23,696 INFO L93 Difference]: Finished difference Result 1379 states and 1937 transitions. [2024-11-07 10:14:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:14:23,698 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2024-11-07 10:14:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:23,700 INFO L225 Difference]: With dead ends: 1379 [2024-11-07 10:14:23,701 INFO L226 Difference]: Without dead ends: 772 [2024-11-07 10:14:23,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:14:23,706 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 296 mSDsluCounter, 1836 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 2146 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:23,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 2146 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:14:23,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-07 10:14:23,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 619. [2024-11-07 10:14:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 574 states have (on average 1.4076655052264808) internal successors, (808), 576 states have internal predecessors, (808), 33 states have call successors, (33), 11 states have call predecessors, (33), 11 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 10:14:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 874 transitions. [2024-11-07 10:14:23,737 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 874 transitions. Word has length 121 [2024-11-07 10:14:23,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:23,737 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 874 transitions. [2024-11-07 10:14:23,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:14:23,738 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 874 transitions. [2024-11-07 10:14:23,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 10:14:23,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:23,740 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:23,747 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 [2024-11-07 10:14:23,940 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 [2024-11-07 10:14:23,940 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:23,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:23,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1714153618, now seen corresponding path program 1 times [2024-11-07 10:14:23,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:23,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728785346] [2024-11-07 10:14:23,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:23,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:23,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:23,947 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) [2024-11-07 10:14:23,950 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 [2024-11-07 10:14:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:24,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 10:14:24,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:24,223 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 [2024-11-07 10:14:24,346 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 40 treesize of output 31 [2024-11-07 10:14:24,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:24,500 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 42 treesize of output 22 [2024-11-07 10:14:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-07 10:14:24,537 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:24,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:24,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728785346] [2024-11-07 10:14:24,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728785346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:24,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:24,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:14:24,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650173308] [2024-11-07 10:14:24,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:24,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:14:24,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:24,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:14:24,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:14:24,539 INFO L87 Difference]: Start difference. First operand 619 states and 874 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:14:25,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:25,062 INFO L93 Difference]: Finished difference Result 1417 states and 1979 transitions. [2024-11-07 10:14:25,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:14:25,063 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2024-11-07 10:14:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:25,065 INFO L225 Difference]: With dead ends: 1417 [2024-11-07 10:14:25,065 INFO L226 Difference]: Without dead ends: 801 [2024-11-07 10:14:25,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:14:25,068 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 295 mSDsluCounter, 1873 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:25,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 2189 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:14:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-11-07 10:14:25,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 614. [2024-11-07 10:14:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 569 states have (on average 1.4094903339191565) internal successors, (802), 571 states have internal predecessors, (802), 33 states have call successors, (33), 11 states have call predecessors, (33), 11 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 10:14:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 868 transitions. [2024-11-07 10:14:25,099 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 868 transitions. Word has length 121 [2024-11-07 10:14:25,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:25,100 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 868 transitions. [2024-11-07 10:14:25,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:14:25,100 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 868 transitions. [2024-11-07 10:14:25,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 10:14:25,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:25,101 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:25,109 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 [2024-11-07 10:14:25,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 [2024-11-07 10:14:25,306 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:25,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:25,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1026137293, now seen corresponding path program 1 times [2024-11-07 10:14:25,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:25,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433259558] [2024-11-07 10:14:25,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:25,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:25,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:25,309 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2024-11-07 10:14:25,310 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 (19)] Waiting until timeout for monitored process [2024-11-07 10:14:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:25,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 10:14:25,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:26,180 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 87 treesize of output 33 [2024-11-07 10:14:26,234 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 183 proven. 24 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-07 10:14:26,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:14:26,364 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:14:26,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:26,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433259558] [2024-11-07 10:14:26,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433259558] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:14:26,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:14:26,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-11-07 10:14:26,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518908455] [2024-11-07 10:14:26,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:26,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:14:26,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:26,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:14:26,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:14:26,366 INFO L87 Difference]: Start difference. First operand 614 states and 868 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:26,548 INFO L93 Difference]: Finished difference Result 1144 states and 1595 transitions. [2024-11-07 10:14:26,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:14:26,549 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-07 10:14:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:26,551 INFO L225 Difference]: With dead ends: 1144 [2024-11-07 10:14:26,551 INFO L226 Difference]: Without dead ends: 533 [2024-11-07 10:14:26,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:14:26,552 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 61 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:26,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 729 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:14:26,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-07 10:14:26,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 396. [2024-11-07 10:14:26,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 365 states have (on average 1.4136986301369863) internal successors, (516), 365 states have internal predecessors, (516), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 10:14:26,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 562 transitions. [2024-11-07 10:14:26,573 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 562 transitions. Word has length 123 [2024-11-07 10:14:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:26,573 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 562 transitions. [2024-11-07 10:14:26,573 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:26,573 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 562 transitions. [2024-11-07 10:14:26,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 10:14:26,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:26,574 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:26,581 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 (19)] Ended with exit code 0 [2024-11-07 10:14:26,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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 [2024-11-07 10:14:26,779 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:26,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:26,779 INFO L85 PathProgramCache]: Analyzing trace with hash 584300748, now seen corresponding path program 1 times [2024-11-07 10:14:26,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:26,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578808090] [2024-11-07 10:14:26,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:26,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:26,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:26,783 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) [2024-11-07 10:14:26,784 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 [2024-11-07 10:14:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:26,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 10:14:26,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:27,005 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:14:27,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:27,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:27,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578808090] [2024-11-07 10:14:27,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578808090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:27,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:27,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:14:27,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204283398] [2024-11-07 10:14:27,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:27,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:14:27,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:27,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:14:27,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:14:27,007 INFO L87 Difference]: Start difference. First operand 396 states and 562 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:27,039 INFO L93 Difference]: Finished difference Result 402 states and 568 transitions. [2024-11-07 10:14:27,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:14:27,040 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-07 10:14:27,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:27,042 INFO L225 Difference]: With dead ends: 402 [2024-11-07 10:14:27,042 INFO L226 Difference]: Without dead ends: 400 [2024-11-07 10:14:27,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:14:27,042 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:27,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 900 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:14:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-07 10:14:27,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2024-11-07 10:14:27,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 369 states have (on average 1.4092140921409213) internal successors, (520), 369 states have internal predecessors, (520), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 10:14:27,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 566 transitions. [2024-11-07 10:14:27,069 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 566 transitions. Word has length 123 [2024-11-07 10:14:27,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:27,069 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 566 transitions. [2024-11-07 10:14:27,070 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:27,070 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 566 transitions. [2024-11-07 10:14:27,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 10:14:27,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:27,071 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:27,082 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 [2024-11-07 10:14:27,271 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 [2024-11-07 10:14:27,272 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:27,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:27,272 INFO L85 PathProgramCache]: Analyzing trace with hash 832806030, now seen corresponding path program 1 times [2024-11-07 10:14:27,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:27,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42026127] [2024-11-07 10:14:27,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:27,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:27,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:27,275 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2024-11-07 10:14:27,280 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 (21)] Waiting until timeout for monitored process [2024-11-07 10:14:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:27,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 10:14:27,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:27,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:14:27,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:27,688 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 77 treesize of output 54 [2024-11-07 10:14:27,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:27,753 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 68 treesize of output 42 [2024-11-07 10:14:27,755 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 40 treesize of output 22 [2024-11-07 10:14:27,789 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:14:27,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:27,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:27,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42026127] [2024-11-07 10:14:27,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42026127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:27,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:27,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:14:27,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951221631] [2024-11-07 10:14:27,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:27,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:14:27,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:27,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:14:27,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:14:27,790 INFO L87 Difference]: Start difference. First operand 400 states and 566 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:28,937 INFO L93 Difference]: Finished difference Result 1097 states and 1526 transitions. [2024-11-07 10:14:28,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:14:28,938 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-07 10:14:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:28,941 INFO L225 Difference]: With dead ends: 1097 [2024-11-07 10:14:28,941 INFO L226 Difference]: Without dead ends: 700 [2024-11-07 10:14:28,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:14:28,942 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 400 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:28,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 947 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 10:14:28,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-07 10:14:29,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 692. [2024-11-07 10:14:29,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 617 states have (on average 1.3776337115072934) internal successors, (850), 621 states have internal predecessors, (850), 53 states have call successors, (53), 21 states have call predecessors, (53), 21 states have return successors, (53), 49 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-07 10:14:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 956 transitions. [2024-11-07 10:14:29,005 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 956 transitions. Word has length 123 [2024-11-07 10:14:29,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:29,006 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 956 transitions. [2024-11-07 10:14:29,006 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:29,007 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 956 transitions. [2024-11-07 10:14:29,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 10:14:29,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:29,008 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:29,022 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 (21)] Ended with exit code 0 [2024-11-07 10:14:29,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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 [2024-11-07 10:14:29,208 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:29,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:29,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1051660748, now seen corresponding path program 1 times [2024-11-07 10:14:29,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:29,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551806866] [2024-11-07 10:14:29,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:29,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:29,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:29,213 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) [2024-11-07 10:14:29,214 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 [2024-11-07 10:14:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:29,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 10:14:29,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:29,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:14:29,623 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 62 treesize of output 40 [2024-11-07 10:14:29,678 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 53 treesize of output 35 [2024-11-07 10:14:29,680 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 41 treesize of output 23 [2024-11-07 10:14:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:14:29,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:29,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:29,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551806866] [2024-11-07 10:14:29,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551806866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:29,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:29,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:14:29,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120886269] [2024-11-07 10:14:29,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:29,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:14:29,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:29,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:14:29,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:14:29,737 INFO L87 Difference]: Start difference. First operand 692 states and 956 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:31,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:31,675 INFO L93 Difference]: Finished difference Result 1595 states and 2199 transitions. [2024-11-07 10:14:31,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:14:31,676 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-07 10:14:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:31,680 INFO L225 Difference]: With dead ends: 1595 [2024-11-07 10:14:31,680 INFO L226 Difference]: Without dead ends: 906 [2024-11-07 10:14:31,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:14:31,682 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 298 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:31,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1189 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 10:14:31,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2024-11-07 10:14:31,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 800. [2024-11-07 10:14:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 725 states have (on average 1.3944827586206896) internal successors, (1011), 729 states have internal predecessors, (1011), 53 states have call successors, (53), 21 states have call predecessors, (53), 21 states have return successors, (53), 49 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-07 10:14:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1117 transitions. [2024-11-07 10:14:31,749 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1117 transitions. Word has length 123 [2024-11-07 10:14:31,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:31,749 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1117 transitions. [2024-11-07 10:14:31,749 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:31,749 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1117 transitions. [2024-11-07 10:14:31,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 10:14:31,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:31,751 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:31,767 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 [2024-11-07 10:14:31,951 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 [2024-11-07 10:14:31,952 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:31,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:31,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1795626592, now seen corresponding path program 1 times [2024-11-07 10:14:31,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:31,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574942029] [2024-11-07 10:14:31,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:31,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:31,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:31,955 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) [2024-11-07 10:14:31,957 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 [2024-11-07 10:14:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:32,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 10:14:32,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:32,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:14:32,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:32,488 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 76 treesize of output 53 [2024-11-07 10:14:32,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:32,557 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 67 treesize of output 41 [2024-11-07 10:14:32,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 39 treesize of output 21 [2024-11-07 10:14:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:14:32,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:32,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:32,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574942029] [2024-11-07 10:14:32,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574942029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:32,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:32,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:14:32,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206965095] [2024-11-07 10:14:32,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:32,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:14:32,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:32,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:14:32,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:14:32,601 INFO L87 Difference]: Start difference. First operand 800 states and 1117 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:34,033 INFO L93 Difference]: Finished difference Result 1807 states and 2512 transitions. [2024-11-07 10:14:34,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:14:34,034 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-07 10:14:34,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:34,038 INFO L225 Difference]: With dead ends: 1807 [2024-11-07 10:14:34,038 INFO L226 Difference]: Without dead ends: 1010 [2024-11-07 10:14:34,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:14:34,040 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 294 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:34,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1276 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 10:14:34,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2024-11-07 10:14:34,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 825. [2024-11-07 10:14:34,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 774 states have (on average 1.4276485788113695) internal successors, (1105), 776 states have internal predecessors, (1105), 34 states have call successors, (34), 16 states have call predecessors, (34), 16 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 10:14:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1173 transitions. [2024-11-07 10:14:34,096 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1173 transitions. Word has length 123 [2024-11-07 10:14:34,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:34,096 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1173 transitions. [2024-11-07 10:14:34,096 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:34,097 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1173 transitions. [2024-11-07 10:14:34,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 10:14:34,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:34,099 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:34,112 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 [2024-11-07 10:14:34,299 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 [2024-11-07 10:14:34,299 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:34,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:34,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1681692254, now seen corresponding path program 1 times [2024-11-07 10:14:34,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:34,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160819694] [2024-11-07 10:14:34,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:34,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 [2024-11-07 10:14:34,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:34,303 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) [2024-11-07 10:14:34,304 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 [2024-11-07 10:14:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:34,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 10:14:34,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:34,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:14:34,924 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 61 treesize of output 39 [2024-11-07 10:14:34,982 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 52 treesize of output 34 [2024-11-07 10:14:34,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2024-11-07 10:14:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:14:35,047 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:35,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:35,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160819694] [2024-11-07 10:14:35,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160819694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:35,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:35,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:14:35,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354408118] [2024-11-07 10:14:35,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:35,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:14:35,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:35,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:14:35,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:14:35,048 INFO L87 Difference]: Start difference. First operand 825 states and 1173 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:37,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:37,155 INFO L93 Difference]: Finished difference Result 2038 states and 2852 transitions. [2024-11-07 10:14:37,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:14:37,156 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-07 10:14:37,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:37,161 INFO L225 Difference]: With dead ends: 2038 [2024-11-07 10:14:37,161 INFO L226 Difference]: Without dead ends: 1216 [2024-11-07 10:14:37,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:14:37,162 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 304 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:37,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1328 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 10:14:37,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2024-11-07 10:14:37,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 933. [2024-11-07 10:14:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 882 states have (on average 1.435374149659864) internal successors, (1266), 884 states have internal predecessors, (1266), 34 states have call successors, (34), 16 states have call predecessors, (34), 16 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 10:14:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1334 transitions. [2024-11-07 10:14:37,218 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1334 transitions. Word has length 123 [2024-11-07 10:14:37,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:37,218 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1334 transitions. [2024-11-07 10:14:37,218 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:37,219 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1334 transitions. [2024-11-07 10:14:37,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 10:14:37,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:37,220 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:37,231 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 (24)] Ended with exit code 0 [2024-11-07 10:14:37,424 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 [2024-11-07 10:14:37,425 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:37,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:37,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1623524199, now seen corresponding path program 1 times [2024-11-07 10:14:37,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:37,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667684996] [2024-11-07 10:14:37,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:37,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:37,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:37,431 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) [2024-11-07 10:14:37,440 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 [2024-11-07 10:14:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:37,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 10:14:37,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:37,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:14:37,989 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 31 treesize of output 15 [2024-11-07 10:14:37,999 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 33 treesize of output 26 [2024-11-07 10:14:38,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:38,033 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 15 [2024-11-07 10:14:38,053 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-07 10:14:38,053 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:14:38,298 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 10:14:38,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:38,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667684996] [2024-11-07 10:14:38,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667684996] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:14:38,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:14:38,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-07 10:14:38,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104587547] [2024-11-07 10:14:38,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:14:38,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:14:38,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:38,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:14:38,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:14:38,301 INFO L87 Difference]: Start difference. First operand 933 states and 1334 transitions. Second operand has 13 states, 11 states have (on average 6.636363636363637) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-07 10:14:39,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:39,153 INFO L93 Difference]: Finished difference Result 2088 states and 2954 transitions. [2024-11-07 10:14:39,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-07 10:14:39,154 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.636363636363637) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 125 [2024-11-07 10:14:39,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:39,158 INFO L225 Difference]: With dead ends: 2088 [2024-11-07 10:14:39,158 INFO L226 Difference]: Without dead ends: 1158 [2024-11-07 10:14:39,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2024-11-07 10:14:39,160 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 697 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:39,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 1102 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:14:39,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-07 10:14:39,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 933. [2024-11-07 10:14:39,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 882 states have (on average 1.4263038548752835) internal successors, (1258), 884 states have internal predecessors, (1258), 34 states have call successors, (34), 16 states have call predecessors, (34), 16 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 10:14:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1326 transitions. [2024-11-07 10:14:39,215 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1326 transitions. Word has length 125 [2024-11-07 10:14:39,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:39,215 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1326 transitions. [2024-11-07 10:14:39,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.636363636363637) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-07 10:14:39,216 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1326 transitions. [2024-11-07 10:14:39,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 10:14:39,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:39,218 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:39,228 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 [2024-11-07 10:14:39,418 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 [2024-11-07 10:14:39,419 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:39,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:39,420 INFO L85 PathProgramCache]: Analyzing trace with hash 35176297, now seen corresponding path program 1 times [2024-11-07 10:14:39,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:39,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837580422] [2024-11-07 10:14:39,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:39,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:39,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:39,423 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) [2024-11-07 10:14:39,424 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 [2024-11-07 10:14:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:39,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 10:14:39,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:39,729 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:14:39,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:39,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:39,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837580422] [2024-11-07 10:14:39,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837580422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:39,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:39,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:14:39,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190948471] [2024-11-07 10:14:39,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:39,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:14:39,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:39,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:14:39,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:14:39,732 INFO L87 Difference]: Start difference. First operand 933 states and 1326 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:40,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:40,067 INFO L93 Difference]: Finished difference Result 2481 states and 3512 transitions. [2024-11-07 10:14:40,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:14:40,067 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-07 10:14:40,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:40,073 INFO L225 Difference]: With dead ends: 2481 [2024-11-07 10:14:40,073 INFO L226 Difference]: Without dead ends: 1551 [2024-11-07 10:14:40,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:14:40,075 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 140 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:40,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 928 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:14:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2024-11-07 10:14:40,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 981. [2024-11-07 10:14:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 930 states have (on average 1.4172043010752688) internal successors, (1318), 932 states have internal predecessors, (1318), 34 states have call successors, (34), 16 states have call predecessors, (34), 16 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 10:14:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1386 transitions. [2024-11-07 10:14:40,134 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1386 transitions. Word has length 125 [2024-11-07 10:14:40,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:40,134 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1386 transitions. [2024-11-07 10:14:40,135 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:40,135 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1386 transitions. [2024-11-07 10:14:40,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 10:14:40,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:40,137 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:40,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 [2024-11-07 10:14:40,337 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 [2024-11-07 10:14:40,338 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:40,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:40,338 INFO L85 PathProgramCache]: Analyzing trace with hash -551629717, now seen corresponding path program 1 times [2024-11-07 10:14:40,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:40,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633777141] [2024-11-07 10:14:40,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:40,339 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:40,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:40,342 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) [2024-11-07 10:14:40,346 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 [2024-11-07 10:14:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:40,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 10:14:40,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:40,710 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 [2024-11-07 10:14:40,898 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 68 treesize of output 32 [2024-11-07 10:14:41,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:41,534 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 126 treesize of output 54 [2024-11-07 10:14:41,577 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-07 10:14:41,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:41,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:41,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633777141] [2024-11-07 10:14:41,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633777141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:41,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:41,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:14:41,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499063535] [2024-11-07 10:14:41,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:41,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:14:41,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:41,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:14:41,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:14:41,578 INFO L87 Difference]: Start difference. First operand 981 states and 1386 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:14:42,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:42,296 INFO L93 Difference]: Finished difference Result 2871 states and 4066 transitions. [2024-11-07 10:14:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:14:42,297 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-11-07 10:14:42,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:42,304 INFO L225 Difference]: With dead ends: 2871 [2024-11-07 10:14:42,304 INFO L226 Difference]: Without dead ends: 1893 [2024-11-07 10:14:42,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:14:42,306 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 291 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:42,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1067 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:14:42,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2024-11-07 10:14:42,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1128. [2024-11-07 10:14:42,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1056 states have (on average 1.4043560606060606) internal successors, (1483), 1059 states have internal predecessors, (1483), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:14:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1579 transitions. [2024-11-07 10:14:42,400 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1579 transitions. Word has length 125 [2024-11-07 10:14:42,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:42,400 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1579 transitions. [2024-11-07 10:14:42,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:14:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1579 transitions. [2024-11-07 10:14:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 10:14:42,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:42,403 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:42,413 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 [2024-11-07 10:14:42,607 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 [2024-11-07 10:14:42,608 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:42,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:42,608 INFO L85 PathProgramCache]: Analyzing trace with hash 303655785, now seen corresponding path program 1 times [2024-11-07 10:14:42,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:42,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370231959] [2024-11-07 10:14:42,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:42,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:42,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:42,611 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) [2024-11-07 10:14:42,613 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 [2024-11-07 10:14:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:42,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 10:14:42,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:42,922 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 [2024-11-07 10:14:43,136 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 52 treesize of output 30 [2024-11-07 10:14:43,192 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 25 [2024-11-07 10:14:43,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2024-11-07 10:14:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-07 10:14:43,234 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:43,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:43,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1370231959] [2024-11-07 10:14:43,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1370231959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:43,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:43,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:14:43,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182953322] [2024-11-07 10:14:43,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:43,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:14:43,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:43,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:14:43,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:14:43,236 INFO L87 Difference]: Start difference. First operand 1128 states and 1579 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:14:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:44,792 INFO L93 Difference]: Finished difference Result 2772 states and 3824 transitions. [2024-11-07 10:14:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:14:44,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-11-07 10:14:44,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:44,805 INFO L225 Difference]: With dead ends: 2772 [2024-11-07 10:14:44,809 INFO L226 Difference]: Without dead ends: 1647 [2024-11-07 10:14:44,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:14:44,811 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 771 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:44,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 688 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 10:14:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2024-11-07 10:14:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1148. [2024-11-07 10:14:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1076 states have (on average 1.407992565055762) internal successors, (1515), 1079 states have internal predecessors, (1515), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:14:44,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1611 transitions. [2024-11-07 10:14:44,932 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1611 transitions. Word has length 125 [2024-11-07 10:14:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:44,932 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1611 transitions. [2024-11-07 10:14:44,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:14:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1611 transitions. [2024-11-07 10:14:44,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 10:14:44,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:44,938 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:44,961 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 [2024-11-07 10:14:45,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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 [2024-11-07 10:14:45,143 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:45,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:45,144 INFO L85 PathProgramCache]: Analyzing trace with hash 169642279, now seen corresponding path program 1 times [2024-11-07 10:14:45,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:45,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414412644] [2024-11-07 10:14:45,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:45,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:45,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:45,148 INFO L229 MonitoredProcess]: Starting monitored process 29 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) [2024-11-07 10:14:45,149 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 (29)] Waiting until timeout for monitored process [2024-11-07 10:14:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:45,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 10:14:45,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:45,521 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 [2024-11-07 10:14:45,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:14:45,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-07 10:14:45,746 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 61 treesize of output 39 [2024-11-07 10:14:46,028 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 52 treesize of output 34 [2024-11-07 10:14:46,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:46,033 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 [2024-11-07 10:14:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:14:46,106 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:46,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:46,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414412644] [2024-11-07 10:14:46,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414412644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:46,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:46,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 10:14:46,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832833328] [2024-11-07 10:14:46,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:46,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 10:14:46,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:46,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 10:14:46,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:14:46,107 INFO L87 Difference]: Start difference. First operand 1148 states and 1611 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:49,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:49,170 INFO L93 Difference]: Finished difference Result 2784 states and 3809 transitions. [2024-11-07 10:14:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 10:14:49,171 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-07 10:14:49,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:49,176 INFO L225 Difference]: With dead ends: 2784 [2024-11-07 10:14:49,176 INFO L226 Difference]: Without dead ends: 1639 [2024-11-07 10:14:49,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:14:49,178 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 524 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:49,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 1996 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1508 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-07 10:14:49,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2024-11-07 10:14:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1139. [2024-11-07 10:14:49,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1067 states have (on average 1.4104967197750702) internal successors, (1505), 1070 states have internal predecessors, (1505), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:14:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1601 transitions. [2024-11-07 10:14:49,242 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1601 transitions. Word has length 125 [2024-11-07 10:14:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:49,242 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1601 transitions. [2024-11-07 10:14:49,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:49,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1601 transitions. [2024-11-07 10:14:49,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 10:14:49,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:49,253 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:49,261 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 (29)] Ended with exit code 0 [2024-11-07 10:14:49,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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 [2024-11-07 10:14:49,453 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:49,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:49,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1082942919, now seen corresponding path program 1 times [2024-11-07 10:14:49,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:49,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452574164] [2024-11-07 10:14:49,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:49,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:49,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:49,457 INFO L229 MonitoredProcess]: Starting monitored process 30 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) [2024-11-07 10:14:49,459 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 (30)] Waiting until timeout for monitored process [2024-11-07 10:14:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:49,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 10:14:49,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:49,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:14:49,793 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 24 treesize of output 23 [2024-11-07 10:14:50,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:50,126 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 34 treesize of output 36 [2024-11-07 10:14:50,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:50,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 51 treesize of output 50 [2024-11-07 10:14:50,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:50,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 38 [2024-11-07 10:14:50,440 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-07 10:14:50,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:14:50,801 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:14:50,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:50,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452574164] [2024-11-07 10:14:50,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452574164] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:14:50,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:14:50,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 20 [2024-11-07 10:14:50,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813839860] [2024-11-07 10:14:50,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:50,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:14:50,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:50,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:14:50,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-07 10:14:50,802 INFO L87 Difference]: Start difference. First operand 1139 states and 1601 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:51,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:51,173 INFO L93 Difference]: Finished difference Result 2326 states and 3264 transitions. [2024-11-07 10:14:51,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:14:51,175 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-07 10:14:51,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:51,183 INFO L225 Difference]: With dead ends: 2326 [2024-11-07 10:14:51,187 INFO L226 Difference]: Without dead ends: 1190 [2024-11-07 10:14:51,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2024-11-07 10:14:51,189 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 106 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:51,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1978 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:14:51,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-11-07 10:14:51,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1142. [2024-11-07 10:14:51,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1070 states have (on average 1.4102803738317757) internal successors, (1509), 1073 states have internal predecessors, (1509), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:14:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1605 transitions. [2024-11-07 10:14:51,294 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1605 transitions. Word has length 125 [2024-11-07 10:14:51,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:51,295 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1605 transitions. [2024-11-07 10:14:51,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:51,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1605 transitions. [2024-11-07 10:14:51,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 10:14:51,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:51,297 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:51,308 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 (30)] Ended with exit code 0 [2024-11-07 10:14:51,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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 [2024-11-07 10:14:51,501 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:51,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:51,502 INFO L85 PathProgramCache]: Analyzing trace with hash 402884549, now seen corresponding path program 1 times [2024-11-07 10:14:51,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:51,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934088306] [2024-11-07 10:14:51,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:51,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:51,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:51,506 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2024-11-07 10:14:51,507 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 (31)] Waiting until timeout for monitored process [2024-11-07 10:14:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:51,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 10:14:51,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:51,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:14:52,012 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 52 treesize of output 38 [2024-11-07 10:14:52,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:14:52,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 64 [2024-11-07 10:14:52,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2024-11-07 10:14:52,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:52,108 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 67 treesize of output 51 [2024-11-07 10:14:52,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:52,304 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 90 treesize of output 42 [2024-11-07 10:14:52,317 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-07 10:14:52,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:14:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 10:14:52,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:52,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934088306] [2024-11-07 10:14:52,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934088306] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:14:52,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:14:52,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2024-11-07 10:14:52,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393940042] [2024-11-07 10:14:52,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:14:52,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:14:52,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:52,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:14:52,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:14:52,505 INFO L87 Difference]: Start difference. First operand 1142 states and 1605 transitions. Second operand has 12 states, 10 states have (on average 8.4) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-07 10:14:53,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:53,091 INFO L93 Difference]: Finished difference Result 2449 states and 3433 transitions. [2024-11-07 10:14:53,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-07 10:14:53,092 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 8.4) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 125 [2024-11-07 10:14:53,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:53,096 INFO L225 Difference]: With dead ends: 2449 [2024-11-07 10:14:53,096 INFO L226 Difference]: Without dead ends: 1310 [2024-11-07 10:14:53,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2024-11-07 10:14:53,098 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 418 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:53,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 887 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:14:53,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2024-11-07 10:14:53,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1140. [2024-11-07 10:14:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1068 states have (on average 1.408239700374532) internal successors, (1504), 1071 states have internal predecessors, (1504), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:14:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1600 transitions. [2024-11-07 10:14:53,158 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1600 transitions. Word has length 125 [2024-11-07 10:14:53,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:53,158 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1600 transitions. [2024-11-07 10:14:53,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 8.4) internal successors, (84), 12 states have internal predecessors, (84), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-07 10:14:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1600 transitions. [2024-11-07 10:14:53,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 10:14:53,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:53,160 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:53,169 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 (31)] Ended with exit code 0 [2024-11-07 10:14:53,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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 [2024-11-07 10:14:53,365 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:53,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:53,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1524087035, now seen corresponding path program 1 times [2024-11-07 10:14:53,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:53,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717626061] [2024-11-07 10:14:53,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:53,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:53,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:53,369 INFO L229 MonitoredProcess]: Starting monitored process 32 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) [2024-11-07 10:14:53,370 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 (32)] Waiting until timeout for monitored process [2024-11-07 10:14:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:53,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 10:14:53,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:53,739 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 [2024-11-07 10:14:53,763 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 24 treesize of output 23 [2024-11-07 10:14:54,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:54,175 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 34 treesize of output 36 [2024-11-07 10:14:54,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:54,227 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 57 treesize of output 29 [2024-11-07 10:14:54,238 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-07 10:14:54,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:14:54,412 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 10:14:54,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:54,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717626061] [2024-11-07 10:14:54,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717626061] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:14:54,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:14:54,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2024-11-07 10:14:54,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934984191] [2024-11-07 10:14:54,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:14:54,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 10:14:54,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:54,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 10:14:54,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:14:54,414 INFO L87 Difference]: Start difference. First operand 1140 states and 1600 transitions. Second operand has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 15 states have internal predecessors, (97), 5 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2024-11-07 10:14:55,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:55,290 INFO L93 Difference]: Finished difference Result 2632 states and 3617 transitions. [2024-11-07 10:14:55,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-07 10:14:55,294 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 15 states have internal predecessors, (97), 5 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) Word has length 125 [2024-11-07 10:14:55,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:55,298 INFO L225 Difference]: With dead ends: 2632 [2024-11-07 10:14:55,298 INFO L226 Difference]: Without dead ends: 1495 [2024-11-07 10:14:55,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2024-11-07 10:14:55,301 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 825 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:55,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1775 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:14:55,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2024-11-07 10:14:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1140. [2024-11-07 10:14:55,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1068 states have (on average 1.402621722846442) internal successors, (1498), 1071 states have internal predecessors, (1498), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:14:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1594 transitions. [2024-11-07 10:14:55,395 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1594 transitions. Word has length 125 [2024-11-07 10:14:55,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:55,395 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1594 transitions. [2024-11-07 10:14:55,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 15 states have internal predecessors, (97), 5 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2024-11-07 10:14:55,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1594 transitions. [2024-11-07 10:14:55,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 10:14:55,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:55,397 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:55,405 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 (32)] Ended with exit code 0 [2024-11-07 10:14:55,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /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 [2024-11-07 10:14:55,602 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:55,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:55,603 INFO L85 PathProgramCache]: Analyzing trace with hash 706438585, now seen corresponding path program 1 times [2024-11-07 10:14:55,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:55,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585192555] [2024-11-07 10:14:55,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:55,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:55,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:55,606 INFO L229 MonitoredProcess]: Starting monitored process 33 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) [2024-11-07 10:14:55,608 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 (33)] Waiting until timeout for monitored process [2024-11-07 10:14:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:55,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 10:14:55,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:55,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:14:56,054 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 41 treesize of output 25 [2024-11-07 10:14:56,083 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 32 treesize of output 20 [2024-11-07 10:14:56,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-07 10:14:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:14:56,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:56,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:56,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585192555] [2024-11-07 10:14:56,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585192555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:56,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:56,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:14:56,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561041675] [2024-11-07 10:14:56,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:56,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:14:56,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:56,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:14:56,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:14:56,116 INFO L87 Difference]: Start difference. First operand 1140 states and 1594 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:57,263 INFO L93 Difference]: Finished difference Result 2526 states and 3487 transitions. [2024-11-07 10:14:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:14:57,264 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-07 10:14:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:57,269 INFO L225 Difference]: With dead ends: 2526 [2024-11-07 10:14:57,269 INFO L226 Difference]: Without dead ends: 1389 [2024-11-07 10:14:57,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:14:57,271 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 146 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:57,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 674 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 10:14:57,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2024-11-07 10:14:57,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1026. [2024-11-07 10:14:57,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 954 states have (on average 1.3962264150943395) internal successors, (1332), 957 states have internal predecessors, (1332), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:14:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1428 transitions. [2024-11-07 10:14:57,357 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1428 transitions. Word has length 125 [2024-11-07 10:14:57,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:57,357 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1428 transitions. [2024-11-07 10:14:57,357 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:14:57,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1428 transitions. [2024-11-07 10:14:57,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 10:14:57,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:57,358 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:57,367 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 (33)] Forceful destruction successful, exit code 0 [2024-11-07 10:14:57,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /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 [2024-11-07 10:14:57,559 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:57,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:57,559 INFO L85 PathProgramCache]: Analyzing trace with hash 544728423, now seen corresponding path program 1 times [2024-11-07 10:14:57,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:57,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722335509] [2024-11-07 10:14:57,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:57,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:57,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:57,567 INFO L229 MonitoredProcess]: Starting monitored process 34 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) [2024-11-07 10:14:57,569 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 (34)] Waiting until timeout for monitored process [2024-11-07 10:14:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:58,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 10:14:58,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:58,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:14:58,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2024-11-07 10:14:58,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 39 [2024-11-07 10:14:58,425 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 52 treesize of output 34 [2024-11-07 10:14:58,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:58,430 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 67 treesize of output 35 [2024-11-07 10:14:58,512 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:14:58,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:58,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:58,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722335509] [2024-11-07 10:14:58,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722335509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:58,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:58,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:14:58,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667721252] [2024-11-07 10:14:58,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:58,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:14:58,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:58,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:14:58,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:14:58,514 INFO L87 Difference]: Start difference. First operand 1026 states and 1428 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:15:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:01,113 INFO L93 Difference]: Finished difference Result 2335 states and 3195 transitions. [2024-11-07 10:15:01,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:15:01,113 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-07 10:15:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:01,122 INFO L225 Difference]: With dead ends: 2335 [2024-11-07 10:15:01,122 INFO L226 Difference]: Without dead ends: 1312 [2024-11-07 10:15:01,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:15:01,124 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 263 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:15:01,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 2112 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 10:15:01,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2024-11-07 10:15:01,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 959. [2024-11-07 10:15:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 887 states have (on average 1.391206313416009) internal successors, (1234), 890 states have internal predecessors, (1234), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:15:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1330 transitions. [2024-11-07 10:15:01,206 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1330 transitions. Word has length 125 [2024-11-07 10:15:01,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:01,206 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1330 transitions. [2024-11-07 10:15:01,206 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:15:01,206 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1330 transitions. [2024-11-07 10:15:01,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 10:15:01,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:01,208 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:01,216 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 (34)] Ended with exit code 0 [2024-11-07 10:15:01,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /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 [2024-11-07 10:15:01,412 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:01,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:01,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1608360919, now seen corresponding path program 1 times [2024-11-07 10:15:01,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:15:01,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050309030] [2024-11-07 10:15:01,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:01,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:15:01,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:15:01,417 INFO L229 MonitoredProcess]: Starting monitored process 35 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) [2024-11-07 10:15:01,418 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 (35)] Waiting until timeout for monitored process [2024-11-07 10:15:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:01,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:15:01,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:15:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-07 10:15:01,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:15:01,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:15:01,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050309030] [2024-11-07 10:15:01,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050309030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:15:01,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:15:01,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:15:01,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075808248] [2024-11-07 10:15:01,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:15:01,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:15:01,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:15:01,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:15:01,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:15:01,724 INFO L87 Difference]: Start difference. First operand 959 states and 1330 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:15:01,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:01,837 INFO L93 Difference]: Finished difference Result 1915 states and 2657 transitions. [2024-11-07 10:15:01,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:15:01,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-11-07 10:15:01,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:01,843 INFO L225 Difference]: With dead ends: 1915 [2024-11-07 10:15:01,843 INFO L226 Difference]: Without dead ends: 959 [2024-11-07 10:15:01,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:15:01,845 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:15:01,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 541 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:15:01,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2024-11-07 10:15:01,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 959. [2024-11-07 10:15:01,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 887 states have (on average 1.3889515219842166) internal successors, (1232), 890 states have internal predecessors, (1232), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:15:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1328 transitions. [2024-11-07 10:15:01,956 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1328 transitions. Word has length 125 [2024-11-07 10:15:01,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:01,957 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1328 transitions. [2024-11-07 10:15:01,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:15:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1328 transitions. [2024-11-07 10:15:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 10:15:01,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:01,959 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:01,967 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 (35)] Forceful destruction successful, exit code 0 [2024-11-07 10:15:02,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /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 [2024-11-07 10:15:02,163 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:02,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:02,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1986579601, now seen corresponding path program 1 times [2024-11-07 10:15:02,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:15:02,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276632182] [2024-11-07 10:15:02,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:02,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:15:02,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:15:02,168 INFO L229 MonitoredProcess]: Starting monitored process 36 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) [2024-11-07 10:15:02,169 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 (36)] Waiting until timeout for monitored process [2024-11-07 10:15:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:02,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 10:15:02,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:15:02,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:15:02,800 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 31 treesize of output 15 [2024-11-07 10:15:02,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2024-11-07 10:15:02,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:15:02,912 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 77 treesize of output 35 [2024-11-07 10:15:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-07 10:15:02,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:15:03,156 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:15:03,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:15:03,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276632182] [2024-11-07 10:15:03,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276632182] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:15:03,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:15:03,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 17 [2024-11-07 10:15:03,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170188244] [2024-11-07 10:15:03,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:15:03,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:15:03,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:15:03,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:15:03,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:15:03,159 INFO L87 Difference]: Start difference. First operand 959 states and 1328 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:15:03,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:03,444 INFO L93 Difference]: Finished difference Result 1233 states and 1711 transitions. [2024-11-07 10:15:03,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 10:15:03,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 126 [2024-11-07 10:15:03,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:03,449 INFO L225 Difference]: With dead ends: 1233 [2024-11-07 10:15:03,449 INFO L226 Difference]: Without dead ends: 1231 [2024-11-07 10:15:03,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2024-11-07 10:15:03,451 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 99 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:15:03,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1222 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:15:03,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2024-11-07 10:15:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1199. [2024-11-07 10:15:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 1127 states have (on average 1.4001774622892635) internal successors, (1578), 1130 states have internal predecessors, (1578), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:15:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1674 transitions. [2024-11-07 10:15:03,558 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1674 transitions. Word has length 126 [2024-11-07 10:15:03,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:03,558 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 1674 transitions. [2024-11-07 10:15:03,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:15:03,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1674 transitions. [2024-11-07 10:15:03,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 10:15:03,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:03,560 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:03,571 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 (36)] Ended with exit code 0 [2024-11-07 10:15:03,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /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 [2024-11-07 10:15:03,765 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:03,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:03,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1245774105, now seen corresponding path program 1 times [2024-11-07 10:15:03,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:15:03,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251436663] [2024-11-07 10:15:03,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:03,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:15:03,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:15:03,769 INFO L229 MonitoredProcess]: Starting monitored process 37 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) [2024-11-07 10:15:03,771 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 (37)] Waiting until timeout for monitored process [2024-11-07 10:15:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:04,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:15:04,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:15:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-07 10:15:04,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:15:04,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:15:04,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251436663] [2024-11-07 10:15:04,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251436663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:15:04,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:15:04,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:15:04,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009067669] [2024-11-07 10:15:04,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:15:04,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:15:04,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:15:04,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:15:04,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:15:04,044 INFO L87 Difference]: Start difference. First operand 1199 states and 1674 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 10:15:04,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:04,191 INFO L93 Difference]: Finished difference Result 2419 states and 3371 transitions. [2024-11-07 10:15:04,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:15:04,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 127 [2024-11-07 10:15:04,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:04,198 INFO L225 Difference]: With dead ends: 2419 [2024-11-07 10:15:04,199 INFO L226 Difference]: Without dead ends: 1219 [2024-11-07 10:15:04,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:15:04,207 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:15:04,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 802 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:15:04,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2024-11-07 10:15:04,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1199. [2024-11-07 10:15:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 1127 states have (on average 1.3984028393966281) internal successors, (1576), 1130 states have internal predecessors, (1576), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:15:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1672 transitions. [2024-11-07 10:15:04,323 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1672 transitions. Word has length 127 [2024-11-07 10:15:04,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:04,323 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 1672 transitions. [2024-11-07 10:15:04,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 10:15:04,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1672 transitions. [2024-11-07 10:15:04,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 10:15:04,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:04,325 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:04,335 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 (37)] Ended with exit code 0 [2024-11-07 10:15:04,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /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 [2024-11-07 10:15:04,527 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:04,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:04,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1697807973, now seen corresponding path program 1 times [2024-11-07 10:15:04,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:15:04,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153055182] [2024-11-07 10:15:04,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:04,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:15:04,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:15:04,532 INFO L229 MonitoredProcess]: Starting monitored process 38 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) [2024-11-07 10:15:04,533 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 (38)] Waiting until timeout for monitored process [2024-11-07 10:15:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:04,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 10:15:04,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:15:04,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:15:04,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:15:04,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:15:04,881 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 26 treesize of output 14 [2024-11-07 10:15:04,966 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 31 treesize of output 26 [2024-11-07 10:15:05,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:15:05,044 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 71 treesize of output 37 [2024-11-07 10:15:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:15:05,141 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:15:05,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:15:05,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153055182] [2024-11-07 10:15:05,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153055182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:15:05,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:15:05,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 10:15:05,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582814934] [2024-11-07 10:15:05,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:15:05,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:15:05,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:15:05,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:15:05,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:15:05,143 INFO L87 Difference]: Start difference. First operand 1199 states and 1672 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:15:08,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:08,250 INFO L93 Difference]: Finished difference Result 3311 states and 4467 transitions. [2024-11-07 10:15:08,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 10:15:08,253 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-11-07 10:15:08,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:08,258 INFO L225 Difference]: With dead ends: 3311 [2024-11-07 10:15:08,258 INFO L226 Difference]: Without dead ends: 2115 [2024-11-07 10:15:08,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-11-07 10:15:08,260 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 537 mSDsluCounter, 1820 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 2077 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:15:08,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 2077 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 10:15:08,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2024-11-07 10:15:08,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 1294. [2024-11-07 10:15:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1222 states have (on average 1.397708674304419) internal successors, (1708), 1225 states have internal predecessors, (1708), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:15:08,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1804 transitions. [2024-11-07 10:15:08,417 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1804 transitions. Word has length 127 [2024-11-07 10:15:08,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:08,417 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1804 transitions. [2024-11-07 10:15:08,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:15:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1804 transitions. [2024-11-07 10:15:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 10:15:08,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:08,420 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:08,432 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 (38)] Forceful destruction successful, exit code 0 [2024-11-07 10:15:08,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /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 [2024-11-07 10:15:08,621 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:08,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:08,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1916662691, now seen corresponding path program 1 times [2024-11-07 10:15:08,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:15:08,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364527974] [2024-11-07 10:15:08,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:08,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:15:08,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:15:08,625 INFO L229 MonitoredProcess]: Starting monitored process 39 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) [2024-11-07 10:15:08,626 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 (39)] Waiting until timeout for monitored process [2024-11-07 10:15:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:08,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 10:15:08,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:15:08,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:15:08,938 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 [2024-11-07 10:15:08,970 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 30 treesize of output 14 [2024-11-07 10:15:09,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:15:09,025 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 30 treesize of output 32 [2024-11-07 10:15:09,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:15:09,058 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 70 treesize of output 34 [2024-11-07 10:15:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-07 10:15:09,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:15:09,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:15:09,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364527974] [2024-11-07 10:15:09,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364527974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:15:09,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:15:09,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:15:09,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646574103] [2024-11-07 10:15:09,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:15:09,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:15:09,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:15:09,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:15:09,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:15:09,094 INFO L87 Difference]: Start difference. First operand 1294 states and 1804 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:15:10,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:10,052 INFO L93 Difference]: Finished difference Result 3210 states and 4448 transitions. [2024-11-07 10:15:10,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:15:10,052 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2024-11-07 10:15:10,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:10,061 INFO L225 Difference]: With dead ends: 3210 [2024-11-07 10:15:10,065 INFO L226 Difference]: Without dead ends: 1919 [2024-11-07 10:15:10,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:15:10,071 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 261 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:15:10,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1075 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 10:15:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2024-11-07 10:15:10,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1354. [2024-11-07 10:15:10,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1282 states have (on average 1.4032761310452417) internal successors, (1799), 1285 states have internal predecessors, (1799), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:15:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1895 transitions. [2024-11-07 10:15:10,254 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1895 transitions. Word has length 127 [2024-11-07 10:15:10,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:10,254 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1895 transitions. [2024-11-07 10:15:10,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:15:10,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1895 transitions. [2024-11-07 10:15:10,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:15:10,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:10,257 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:10,269 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 (39)] Ended with exit code 0 [2024-11-07 10:15:10,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /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 [2024-11-07 10:15:10,469 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:10,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:10,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1422346700, now seen corresponding path program 1 times [2024-11-07 10:15:10,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:15:10,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519119788] [2024-11-07 10:15:10,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:10,470 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:15:10,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:15:10,474 INFO L229 MonitoredProcess]: Starting monitored process 40 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) [2024-11-07 10:15:10,475 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 (40)] Waiting until timeout for monitored process [2024-11-07 10:15:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:10,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 10:15:10,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:15:10,849 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 [2024-11-07 10:15:11,319 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 41 treesize of output 19 [2024-11-07 10:15:11,345 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 43 treesize of output 30 [2024-11-07 10:15:11,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:15:11,551 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 76 treesize of output 34 [2024-11-07 10:15:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 149 proven. 30 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-11-07 10:15:11,660 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:15:12,429 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 10:15:12,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:15:12,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519119788] [2024-11-07 10:15:12,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519119788] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:15:12,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:15:12,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2024-11-07 10:15:12,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894936762] [2024-11-07 10:15:12,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:15:12,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 10:15:12,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:15:12,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 10:15:12,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2024-11-07 10:15:12,431 INFO L87 Difference]: Start difference. First operand 1354 states and 1895 transitions. Second operand has 26 states, 24 states have (on average 5.166666666666667) internal successors, (124), 26 states have internal predecessors, (124), 6 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 6 states have call successors, (26) [2024-11-07 10:15:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:13,992 INFO L93 Difference]: Finished difference Result 1432 states and 1979 transitions. [2024-11-07 10:15:13,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-07 10:15:13,993 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.166666666666667) internal successors, (124), 26 states have internal predecessors, (124), 6 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 6 states have call successors, (26) Word has length 128 [2024-11-07 10:15:13,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:13,996 INFO L225 Difference]: With dead ends: 1432 [2024-11-07 10:15:13,996 INFO L226 Difference]: Without dead ends: 1430 [2024-11-07 10:15:13,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=291, Invalid=1601, Unknown=0, NotChecked=0, Total=1892 [2024-11-07 10:15:13,998 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 727 mSDsluCounter, 2063 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:15:13,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 2209 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 10:15:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2024-11-07 10:15:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1358. [2024-11-07 10:15:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1286 states have (on average 1.4035769828926905) internal successors, (1805), 1289 states have internal predecessors, (1805), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:15:14,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1901 transitions. [2024-11-07 10:15:14,113 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1901 transitions. Word has length 128 [2024-11-07 10:15:14,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:14,117 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1901 transitions. [2024-11-07 10:15:14,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.166666666666667) internal successors, (124), 26 states have internal predecessors, (124), 6 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 6 states have call successors, (26) [2024-11-07 10:15:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1901 transitions. [2024-11-07 10:15:14,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:15:14,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:14,120 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:14,128 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 (40)] Forceful destruction successful, exit code 0 [2024-11-07 10:15:14,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /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 [2024-11-07 10:15:14,320 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:14,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:14,321 INFO L85 PathProgramCache]: Analyzing trace with hash 601607126, now seen corresponding path program 1 times [2024-11-07 10:15:14,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:15:14,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633848213] [2024-11-07 10:15:14,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:14,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:15:14,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:15:14,324 INFO L229 MonitoredProcess]: Starting monitored process 41 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) [2024-11-07 10:15:14,325 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 (41)] Waiting until timeout for monitored process [2024-11-07 10:15:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:14,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 10:15:14,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:15:14,714 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 [2024-11-07 10:15:15,048 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 41 treesize of output 19 [2024-11-07 10:15:15,094 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 36 treesize of output 29 [2024-11-07 10:15:15,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:15:15,210 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 38 [2024-11-07 10:15:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 149 proven. 30 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-11-07 10:15:15,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:15:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 10:15:15,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:15:15,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633848213] [2024-11-07 10:15:15,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633848213] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:15:15,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:15:15,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2024-11-07 10:15:15,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352838004] [2024-11-07 10:15:15,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:15:15,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 10:15:15,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:15:15,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 10:15:15,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2024-11-07 10:15:15,688 INFO L87 Difference]: Start difference. First operand 1358 states and 1901 transitions. Second operand has 24 states, 22 states have (on average 5.636363636363637) internal successors, (124), 24 states have internal predecessors, (124), 6 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 6 states have call successors, (26) [2024-11-07 10:15:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:16,631 INFO L93 Difference]: Finished difference Result 1412 states and 1957 transitions. [2024-11-07 10:15:16,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 10:15:16,632 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 5.636363636363637) internal successors, (124), 24 states have internal predecessors, (124), 6 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 6 states have call successors, (26) Word has length 128 [2024-11-07 10:15:16,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:16,636 INFO L225 Difference]: With dead ends: 1412 [2024-11-07 10:15:16,636 INFO L226 Difference]: Without dead ends: 1410 [2024-11-07 10:15:16,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=1101, Unknown=0, NotChecked=0, Total=1332 [2024-11-07 10:15:16,641 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 541 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:15:16,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1730 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:15:16,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2024-11-07 10:15:16,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1358. [2024-11-07 10:15:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1286 states have (on average 1.4035769828926905) internal successors, (1805), 1289 states have internal predecessors, (1805), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:15:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1901 transitions. [2024-11-07 10:15:16,795 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1901 transitions. Word has length 128 [2024-11-07 10:15:16,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:16,796 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1901 transitions. [2024-11-07 10:15:16,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 5.636363636363637) internal successors, (124), 24 states have internal predecessors, (124), 6 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 6 states have call successors, (26) [2024-11-07 10:15:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1901 transitions. [2024-11-07 10:15:16,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 10:15:16,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:16,802 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:16,811 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 (41)] Ended with exit code 0 [2024-11-07 10:15:17,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /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 [2024-11-07 10:15:17,003 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:17,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:17,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1148160964, now seen corresponding path program 1 times [2024-11-07 10:15:17,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:15:17,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498805489] [2024-11-07 10:15:17,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:17,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:15:17,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:15:17,008 INFO L229 MonitoredProcess]: Starting monitored process 42 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) [2024-11-07 10:15:17,009 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 (42)] Waiting until timeout for monitored process [2024-11-07 10:15:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:17,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 10:15:17,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:15:17,338 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