./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1251.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1251.c -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 de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 01:22:49,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 01:22:49,673 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 01:22:49,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 01:22:49,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 01:22:49,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 01:22:49,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 01:22:49,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 01:22:49,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 01:22:49,690 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 01:22:49,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 01:22:49,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 01:22:49,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 01:22:49,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 01:22:49,691 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 01:22:49,691 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 01:22:49,691 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 01:22:49,691 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 01:22:49,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 01:22:49,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 01:22:49,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 01:22:49,691 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 01:22:49,691 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 01:22:49,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 01:22:49,691 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 01:22:49,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 01:22:49,691 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 01:22:49,691 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 01:22:49,691 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 01:22:49,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 01:22:49,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 01:22:49,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 01:22:49,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 01:22:49,692 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 01:22:49,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 01:22:49,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 01:22:49,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 01:22:49,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 01:22:49,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 01:22:49,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 01:22:49,692 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 01:22:49,692 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 01:22:49,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 01:22:49,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 01:22:49,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 01:22:49,692 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 01:22:49,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 01:22:49,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 01:22:49,692 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 -> de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d [2025-01-09 01:22:49,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 01:22:49,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 01:22:49,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 01:22:49,993 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 01:22:49,994 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 01:22:49,994 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2025-01-09 01:22:51,221 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab4346ace/b458914129774dc0afd16bb1d1274cb7/FLAG1652d4bfd [2025-01-09 01:22:51,465 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 01:22:51,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2025-01-09 01:22:51,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab4346ace/b458914129774dc0afd16bb1d1274cb7/FLAG1652d4bfd [2025-01-09 01:22:51,803 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab4346ace/b458914129774dc0afd16bb1d1274cb7 [2025-01-09 01:22:51,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 01:22:51,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 01:22:51,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 01:22:51,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 01:22:51,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 01:22:51,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:22:51" (1/1) ... [2025-01-09 01:22:51,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b53348a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:51, skipping insertion in model container [2025-01-09 01:22:51,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:22:51" (1/1) ... [2025-01-09 01:22:51,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 01:22:51,909 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/float-newlib/float_req_bl_1251.c[1980,1993] [2025-01-09 01:22:51,910 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/float-newlib/float_req_bl_1251.c[2139,2152] [2025-01-09 01:22:51,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 01:22:51,916 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 01:22:51,927 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/float-newlib/float_req_bl_1251.c[1980,1993] [2025-01-09 01:22:51,928 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/float-newlib/float_req_bl_1251.c[2139,2152] [2025-01-09 01:22:51,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 01:22:51,937 INFO L204 MainTranslator]: Completed translation [2025-01-09 01:22:51,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:51 WrapperNode [2025-01-09 01:22:51,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 01:22:51,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 01:22:51,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 01:22:51,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 01:22:51,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:51" (1/1) ... [2025-01-09 01:22:51,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:51" (1/1) ... [2025-01-09 01:22:51,963 INFO L138 Inliner]: procedures = 18, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 105 [2025-01-09 01:22:51,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 01:22:51,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 01:22:51,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 01:22:51,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 01:22:51,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:51" (1/1) ... [2025-01-09 01:22:51,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:51" (1/1) ... [2025-01-09 01:22:51,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:51" (1/1) ... [2025-01-09 01:22:51,986 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 1 writes are split as follows [1, 0]. [2025-01-09 01:22:51,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:51" (1/1) ... [2025-01-09 01:22:51,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:51" (1/1) ... [2025-01-09 01:22:51,993 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:51" (1/1) ... [2025-01-09 01:22:51,997 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:51" (1/1) ... [2025-01-09 01:22:51,999 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:51" (1/1) ... [2025-01-09 01:22:52,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:51" (1/1) ... [2025-01-09 01:22:52,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:51" (1/1) ... [2025-01-09 01:22:52,003 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 01:22:52,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 01:22:52,007 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 01:22:52,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 01:22:52,008 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:51" (1/1) ... [2025-01-09 01:22:52,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 01:22:52,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 01:22:52,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 01:22:52,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 01:22:52,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 01:22:52,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 01:22:52,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 01:22:52,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 01:22:52,060 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2025-01-09 01:22:52,060 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2025-01-09 01:22:52,060 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2025-01-09 01:22:52,060 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2025-01-09 01:22:52,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 01:22:52,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 01:22:52,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 01:22:52,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 01:22:52,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 01:22:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 01:22:52,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 01:22:52,111 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 01:22:52,112 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 01:22:52,232 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-01-09 01:22:52,233 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 01:22:52,239 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 01:22:52,239 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 01:22:52,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:22:52 BoogieIcfgContainer [2025-01-09 01:22:52,240 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 01:22:52,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 01:22:52,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 01:22:52,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 01:22:52,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:22:51" (1/3) ... [2025-01-09 01:22:52,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e17d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:22:52, skipping insertion in model container [2025-01-09 01:22:52,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:51" (2/3) ... [2025-01-09 01:22:52,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e17d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:22:52, skipping insertion in model container [2025-01-09 01:22:52,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:22:52" (3/3) ... [2025-01-09 01:22:52,246 INFO L128 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2025-01-09 01:22:52,255 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 01:22:52,257 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG float_req_bl_1251.c that has 3 procedures, 57 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-01-09 01:22:52,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 01:22:52,298 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;@70ab2032, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 01:22:52,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 01:22:52,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 44 states have internal predecessors, (61), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 01:22:52,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 01:22:52,307 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:22:52,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:22:52,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __fpclassify_floatErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, __fpclassify_floatErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 01:22:52,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:22:52,312 INFO L85 PathProgramCache]: Analyzing trace with hash -869356436, now seen corresponding path program 1 times [2025-01-09 01:22:52,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 01:22:52,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110295560] [2025-01-09 01:22:52,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:22:52,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 01:22:52,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 01:22:52,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 01:22:52,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:22:52,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:22:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 01:22:52,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 01:22:52,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110295560] [2025-01-09 01:22:52,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110295560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:22:52,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:22:52,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 01:22:52,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48571874] [2025-01-09 01:22:52,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:22:52,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 01:22:52,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 01:22:52,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 01:22:52,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:22:52,485 INFO L87 Difference]: Start difference. First operand has 57 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 44 states have internal predecessors, (61), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 01:22:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:22:52,534 INFO L93 Difference]: Finished difference Result 72 states and 99 transitions. [2025-01-09 01:22:52,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 01:22:52,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-01-09 01:22:52,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:22:52,540 INFO L225 Difference]: With dead ends: 72 [2025-01-09 01:22:52,540 INFO L226 Difference]: Without dead ends: 26 [2025-01-09 01:22:52,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:22:52,549 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 01:22:52,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 01:22:52,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-09 01:22:52,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-01-09 01:22:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 01:22:52,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-01-09 01:22:52,583 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2025-01-09 01:22:52,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:22:52,583 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-01-09 01:22:52,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 01:22:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-01-09 01:22:52,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 01:22:52,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:22:52,585 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:22:52,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 01:22:52,585 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __fpclassify_floatErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, __fpclassify_floatErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 01:22:52,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:22:52,586 INFO L85 PathProgramCache]: Analyzing trace with hash 331451569, now seen corresponding path program 1 times [2025-01-09 01:22:52,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 01:22:52,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360997020] [2025-01-09 01:22:52,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:22:52,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 01:22:52,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 01:22:52,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 01:22:52,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:22:52,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 01:22:52,612 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 01:22:52,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 01:22:52,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 01:22:52,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:22:52,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 01:22:52,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 01:22:52,635 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 01:22:52,636 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __fpclassify_floatErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (2 of 3 remaining) [2025-01-09 01:22:52,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-01-09 01:22:52,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-01-09 01:22:52,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 01:22:52,640 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 01:22:52,652 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 01:22:52,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:22:52 BoogieIcfgContainer [2025-01-09 01:22:52,655 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 01:22:52,655 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 01:22:52,656 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 01:22:52,656 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 01:22:52,656 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:22:52" (3/4) ... [2025-01-09 01:22:52,658 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 01:22:52,658 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 01:22:52,659 INFO L158 Benchmark]: Toolchain (without parser) took 852.92ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 56.7MB in the end (delta: 56.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-09 01:22:52,659 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 01:22:52,659 INFO L158 Benchmark]: CACSL2BoogieTranslator took 130.73ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 101.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 01:22:52,659 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.11ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 01:22:52,660 INFO L158 Benchmark]: Boogie Preprocessor took 38.98ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 01:22:52,660 INFO L158 Benchmark]: RCFGBuilder took 236.37ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 83.3MB in the end (delta: 15.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 01:22:52,660 INFO L158 Benchmark]: TraceAbstraction took 413.58ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 57.2MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 01:22:52,660 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 142.6MB. Free memory was 57.2MB in the beginning and 56.7MB in the end (delta: 492.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 01:22:52,661 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.19ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 130.73ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 101.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.11ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.98ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 236.37ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 83.3MB in the end (delta: 15.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 413.58ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 57.2MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 142.6MB. Free memory was 57.2MB in the beginning and 56.7MB in the end (delta: 492.8kB). Peak memory consumption was 8.4MB. 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: 26]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of union with floats in the HoenickeLindenmann_Original memory model at line 26, overapproximation of someBinaryFLOATComparisonOperation at line 57. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L69] CALL, EXPR isnan_float(x) VAL [\old(x)=55] [L57] return x != x; VAL [\old(x)=55, \result=1] [L69] RET, EXPR isnan_float(x) VAL [x=55] [L69] EXPR isnan_float(x) && !isnan_float(y) VAL [x=55] [L69] CALL, EXPR isnan_float(y) VAL [\old(x)=54] [L57] return x != x; VAL [\old(x)=54, \result=0] [L69] RET, EXPR isnan_float(y) VAL [x=55, y=54] [L69] EXPR isnan_float(x) && !isnan_float(y) VAL [x=55, y=54] [L69-L70] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) VAL [x=55, y=54] [L69-L70] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L72] CALL fmax_float(x, y) [L46] CALL __fpclassify_float(x) VAL [\old(x)=55] [L23] __uint32_t w; VAL [\old(x)=55] [L26] ieee_float_shape_type gf_u; VAL [\old(x)=55] - UnprovableResult [Line: 76]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 57 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 31 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=0, InterpolantAutomatonStates: 4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 16 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 01:22:52,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1251.c -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 de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 01:22:54,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 01:22:54,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 01:22:54,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 01:22:54,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 01:22:54,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 01:22:54,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 01:22:54,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 01:22:54,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 01:22:54,710 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 01:22:54,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 01:22:54,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 01:22:54,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 01:22:54,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 01:22:54,710 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 01:22:54,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 01:22:54,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 01:22:54,710 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 01:22:54,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 01:22:54,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 01:22:54,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 01:22:54,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 01:22:54,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 01:22:54,711 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 01:22:54,711 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 01:22:54,711 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 01:22:54,711 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 01:22:54,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 01:22:54,711 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 01:22:54,711 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 01:22:54,711 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 01:22:54,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 01:22:54,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 01:22:54,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 01:22:54,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 01:22:54,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 01:22:54,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 01:22:54,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 01:22:54,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 01:22:54,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 01:22:54,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 01:22:54,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 01:22:54,717 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 01:22:54,717 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 01:22:54,717 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 01:22:54,717 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 01:22:54,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 01:22:54,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 01:22:54,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 01:22:54,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 01:22:54,717 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 -> de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d [2025-01-09 01:22:54,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 01:22:54,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 01:22:54,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 01:22:54,976 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 01:22:54,976 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 01:22:54,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2025-01-09 01:22:56,194 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de65225fd/a9eff9741a374839b1e113cb9de6220d/FLAGbfba760bd [2025-01-09 01:22:56,435 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 01:22:56,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2025-01-09 01:22:56,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de65225fd/a9eff9741a374839b1e113cb9de6220d/FLAGbfba760bd [2025-01-09 01:22:56,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de65225fd/a9eff9741a374839b1e113cb9de6220d [2025-01-09 01:22:56,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 01:22:56,469 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 01:22:56,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 01:22:56,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 01:22:56,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 01:22:56,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:22:56" (1/1) ... [2025-01-09 01:22:56,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5e1018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:56, skipping insertion in model container [2025-01-09 01:22:56,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:22:56" (1/1) ... [2025-01-09 01:22:56,487 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 01:22:56,613 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/float-newlib/float_req_bl_1251.c[1980,1993] [2025-01-09 01:22:56,616 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/float-newlib/float_req_bl_1251.c[2139,2152] [2025-01-09 01:22:56,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 01:22:56,624 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 01:22:56,644 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/float-newlib/float_req_bl_1251.c[1980,1993] [2025-01-09 01:22:56,646 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/float-newlib/float_req_bl_1251.c[2139,2152] [2025-01-09 01:22:56,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 01:22:56,662 INFO L204 MainTranslator]: Completed translation [2025-01-09 01:22:56,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:56 WrapperNode [2025-01-09 01:22:56,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 01:22:56,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 01:22:56,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 01:22:56,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 01:22:56,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:56" (1/1) ... [2025-01-09 01:22:56,679 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:56" (1/1) ... [2025-01-09 01:22:56,693 INFO L138 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2025-01-09 01:22:56,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 01:22:56,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 01:22:56,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 01:22:56,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 01:22:56,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:56" (1/1) ... [2025-01-09 01:22:56,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:56" (1/1) ... [2025-01-09 01:22:56,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:56" (1/1) ... [2025-01-09 01:22:56,716 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-09 01:22:56,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:56" (1/1) ... [2025-01-09 01:22:56,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:56" (1/1) ... [2025-01-09 01:22:56,726 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:56" (1/1) ... [2025-01-09 01:22:56,730 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:56" (1/1) ... [2025-01-09 01:22:56,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:56" (1/1) ... [2025-01-09 01:22:56,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:56" (1/1) ... [2025-01-09 01:22:56,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:56" (1/1) ... [2025-01-09 01:22:56,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 01:22:56,741 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 01:22:56,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 01:22:56,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 01:22:56,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:56" (1/1) ... [2025-01-09 01:22:56,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 01:22:56,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 01:22:56,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 01:22:56,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 01:22:56,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 01:22:56,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 01:22:56,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 01:22:56,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 01:22:56,793 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2025-01-09 01:22:56,793 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2025-01-09 01:22:56,793 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2025-01-09 01:22:56,793 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2025-01-09 01:22:56,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 01:22:56,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 01:22:56,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 01:22:56,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 01:22:56,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 01:22:56,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 01:22:56,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 01:22:56,852 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 01:22:56,854 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 01:22:57,033 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-01-09 01:22:57,033 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 01:22:57,040 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 01:22:57,040 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 01:22:57,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:22:57 BoogieIcfgContainer [2025-01-09 01:22:57,041 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 01:22:57,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 01:22:57,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 01:22:57,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 01:22:57,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:22:56" (1/3) ... [2025-01-09 01:22:57,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c19bd06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:22:57, skipping insertion in model container [2025-01-09 01:22:57,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:56" (2/3) ... [2025-01-09 01:22:57,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c19bd06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:22:57, skipping insertion in model container [2025-01-09 01:22:57,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:22:57" (3/3) ... [2025-01-09 01:22:57,057 INFO L128 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2025-01-09 01:22:57,079 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 01:22:57,085 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG float_req_bl_1251.c that has 3 procedures, 53 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-01-09 01:22:57,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 01:22:57,159 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;@67b6dfa4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 01:22:57,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 01:22:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 40 states have internal predecessors, (56), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 01:22:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 01:22:57,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:22:57,176 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:22:57,176 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:22:57,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:22:57,188 INFO L85 PathProgramCache]: Analyzing trace with hash 788937103, now seen corresponding path program 1 times [2025-01-09 01:22:57,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:22:57,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189779497] [2025-01-09 01:22:57,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:22:57,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:22:57,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:22:57,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:22:57,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 01:22:57,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 01:22:57,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 01:22:57,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:22:57,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:22:57,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 01:22:57,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:22:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 01:22:57,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:22:57,283 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:22:57,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189779497] [2025-01-09 01:22:57,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189779497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:22:57,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:22:57,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 01:22:57,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547151010] [2025-01-09 01:22:57,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:22:57,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 01:22:57,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:22:57,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 01:22:57,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 01:22:57,299 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 40 states have internal predecessors, (56), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 01:22:57,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:22:57,311 INFO L93 Difference]: Finished difference Result 89 states and 128 transitions. [2025-01-09 01:22:57,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 01:22:57,312 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-01-09 01:22:57,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:22:57,316 INFO L225 Difference]: With dead ends: 89 [2025-01-09 01:22:57,317 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 01:22:57,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 01:22:57,320 INFO L435 NwaCegarLoop]: 72 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, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 01:22:57,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 01:22:57,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 01:22:57,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 01:22:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 01:22:57,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2025-01-09 01:22:57,347 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 27 [2025-01-09 01:22:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:22:57,348 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2025-01-09 01:22:57,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 01:22:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2025-01-09 01:22:57,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 01:22:57,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:22:57,349 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:22:57,353 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 [2025-01-09 01:22:57,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:22:57,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:22:57,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:22:57,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1698537491, now seen corresponding path program 1 times [2025-01-09 01:22:57,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:22:57,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563637950] [2025-01-09 01:22:57,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:22:57,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:22:57,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:22:57,556 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:22:57,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 01:22:57,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 01:22:57,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 01:22:57,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:22:57,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:22:57,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 01:22:57,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:22:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 01:22:57,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:22:57,668 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:22:57,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563637950] [2025-01-09 01:22:57,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563637950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:22:57,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:22:57,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 01:22:57,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556332154] [2025-01-09 01:22:57,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:22:57,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 01:22:57,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:22:57,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 01:22:57,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:22:57,674 INFO L87 Difference]: Start difference. First operand 49 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 01:22:57,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:22:57,710 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2025-01-09 01:22:57,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 01:22:57,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2025-01-09 01:22:57,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:22:57,711 INFO L225 Difference]: With dead ends: 85 [2025-01-09 01:22:57,712 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 01:22:57,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:22:57,717 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 01:22:57,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 01:22:57,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 01:22:57,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-09 01:22:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 01:22:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2025-01-09 01:22:57,727 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 28 [2025-01-09 01:22:57,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:22:57,731 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2025-01-09 01:22:57,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 01:22:57,731 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2025-01-09 01:22:57,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 01:22:57,732 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:22:57,732 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:22:57,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 01:22:57,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:22:57,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:22:57,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:22:57,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1224130798, now seen corresponding path program 1 times [2025-01-09 01:22:57,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:22:57,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330815833] [2025-01-09 01:22:57,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:22:57,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:22:57,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:22:57,937 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:22:57,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 01:22:57,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 01:22:57,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 01:22:57,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:22:57,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:22:58,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 01:22:58,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:22:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 01:22:58,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:22:58,023 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:22:58,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330815833] [2025-01-09 01:22:58,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330815833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:22:58,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:22:58,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 01:22:58,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575255781] [2025-01-09 01:22:58,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:22:58,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 01:22:58,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:22:58,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 01:22:58,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:22:58,025 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 01:22:58,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:22:58,046 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2025-01-09 01:22:58,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 01:22:58,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2025-01-09 01:22:58,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:22:58,049 INFO L225 Difference]: With dead ends: 74 [2025-01-09 01:22:58,049 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 01:22:58,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:22:58,050 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 01:22:58,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 01:22:58,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 01:22:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-01-09 01:22:58,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2025-01-09 01:22:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2025-01-09 01:22:58,056 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 33 [2025-01-09 01:22:58,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:22:58,056 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2025-01-09 01:22:58,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 01:22:58,056 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2025-01-09 01:22:58,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 01:22:58,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:22:58,057 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:22:58,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 01:22:58,260 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 [2025-01-09 01:22:58,261 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:22:58,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:22:58,262 INFO L85 PathProgramCache]: Analyzing trace with hash 557039000, now seen corresponding path program 1 times [2025-01-09 01:22:58,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:22:58,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208317458] [2025-01-09 01:22:58,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:22:58,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:22:58,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:22:58,265 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) [2025-01-09 01:22:58,266 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 [2025-01-09 01:22:58,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 01:22:58,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 01:22:58,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:22:58,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:22:58,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 01:22:58,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:22:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 01:22:58,354 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:22:58,354 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:22:58,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208317458] [2025-01-09 01:22:58,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208317458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:22:58,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:22:58,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 01:22:58,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486067601] [2025-01-09 01:22:58,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:22:58,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 01:22:58,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:22:58,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 01:22:58,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:22:58,356 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 01:22:58,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:22:58,375 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2025-01-09 01:22:58,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 01:22:58,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-01-09 01:22:58,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:22:58,376 INFO L225 Difference]: With dead ends: 77 [2025-01-09 01:22:58,377 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 01:22:58,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:22:58,377 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 01:22:58,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 01:22:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 01:22:58,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2025-01-09 01:22:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2025-01-09 01:22:58,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2025-01-09 01:22:58,383 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 34 [2025-01-09 01:22:58,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:22:58,383 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2025-01-09 01:22:58,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 01:22:58,384 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2025-01-09 01:22:58,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 01:22:58,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:22:58,384 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:22:58,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 01:22:58,587 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 [2025-01-09 01:22:58,588 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:22:58,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:22:58,588 INFO L85 PathProgramCache]: Analyzing trace with hash 178417714, now seen corresponding path program 1 times [2025-01-09 01:22:58,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:22:58,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421520106] [2025-01-09 01:22:58,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:22:58,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:22:58,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:22:58,593 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:22:58,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 01:22:58,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 01:22:58,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 01:22:58,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:22:58,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:22:58,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 01:22:58,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:22:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 01:22:58,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:22:58,658 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:22:58,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421520106] [2025-01-09 01:22:58,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421520106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:22:58,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:22:58,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 01:22:58,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246810974] [2025-01-09 01:22:58,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:22:58,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 01:22:58,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:22:58,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 01:22:58,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:22:58,659 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 01:22:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:22:58,676 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2025-01-09 01:22:58,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 01:22:58,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2025-01-09 01:22:58,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:22:58,677 INFO L225 Difference]: With dead ends: 77 [2025-01-09 01:22:58,677 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 01:22:58,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:22:58,677 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 01:22:58,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 01:22:58,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 01:22:58,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2025-01-09 01:22:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2025-01-09 01:22:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2025-01-09 01:22:58,681 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 35 [2025-01-09 01:22:58,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:22:58,683 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2025-01-09 01:22:58,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 01:22:58,684 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2025-01-09 01:22:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 01:22:58,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:22:58,684 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:22:58,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 01:22:58,887 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 [2025-01-09 01:22:58,887 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:22:58,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:22:58,887 INFO L85 PathProgramCache]: Analyzing trace with hash 152447708, now seen corresponding path program 1 times [2025-01-09 01:22:58,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:22:58,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246838487] [2025-01-09 01:22:58,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:22:58,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:22:58,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:22:58,890 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) [2025-01-09 01:22:58,893 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 [2025-01-09 01:22:58,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 01:22:58,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 01:22:58,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:22:58,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:22:58,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 01:22:58,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:22:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 01:22:58,954 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:22:58,954 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:22:58,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246838487] [2025-01-09 01:22:58,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246838487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:22:58,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:22:58,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 01:22:58,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701401609] [2025-01-09 01:22:58,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:22:58,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 01:22:58,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:22:58,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 01:22:58,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:22:58,955 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 01:22:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:22:58,974 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2025-01-09 01:22:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 01:22:58,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2025-01-09 01:22:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:22:58,975 INFO L225 Difference]: With dead ends: 77 [2025-01-09 01:22:58,975 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 01:22:58,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:22:58,976 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 01:22:58,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 01:22:58,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 01:22:58,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2025-01-09 01:22:58,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2025-01-09 01:22:58,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2025-01-09 01:22:58,980 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 36 [2025-01-09 01:22:58,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:22:58,980 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2025-01-09 01:22:58,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 01:22:58,980 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2025-01-09 01:22:58,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 01:22:58,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:22:58,981 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:22:58,986 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 (7)] Ended with exit code 0 [2025-01-09 01:22:59,181 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 [2025-01-09 01:22:59,181 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:22:59,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:22:59,182 INFO L85 PathProgramCache]: Analyzing trace with hash -140955299, now seen corresponding path program 1 times [2025-01-09 01:22:59,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:22:59,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930781587] [2025-01-09 01:22:59,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:22:59,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:22:59,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:22:59,184 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:22:59,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 01:22:59,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 01:22:59,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 01:22:59,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:22:59,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:22:59,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 01:22:59,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:22:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 01:22:59,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 01:22:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 01:22:59,653 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:22:59,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930781587] [2025-01-09 01:22:59,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930781587] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 01:22:59,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 01:22:59,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2025-01-09 01:22:59,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851390537] [2025-01-09 01:22:59,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 01:22:59,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 01:22:59,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:22:59,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 01:22:59,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 01:22:59,654 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 01:23:00,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:00,153 INFO L93 Difference]: Finished difference Result 96 states and 131 transitions. [2025-01-09 01:23:00,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 01:23:00,154 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2025-01-09 01:23:00,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:00,155 INFO L225 Difference]: With dead ends: 96 [2025-01-09 01:23:00,156 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 01:23:00,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-01-09 01:23:00,160 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 58 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:00,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 542 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 01:23:00,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 01:23:00,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2025-01-09 01:23:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 15 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (19), 17 states have call predecessors, (19), 15 states have call successors, (19) [2025-01-09 01:23:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 99 transitions. [2025-01-09 01:23:00,170 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 99 transitions. Word has length 36 [2025-01-09 01:23:00,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:00,170 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 99 transitions. [2025-01-09 01:23:00,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 01:23:00,173 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 99 transitions. [2025-01-09 01:23:00,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 01:23:00,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:00,174 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:00,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-01-09 01:23:00,374 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 [2025-01-09 01:23:00,375 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:00,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:00,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1310368060, now seen corresponding path program 1 times [2025-01-09 01:23:00,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:00,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232052078] [2025-01-09 01:23:00,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:00,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:00,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:00,379 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) [2025-01-09 01:23:00,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-01-09 01:23:00,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 01:23:00,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 01:23:00,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:00,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:00,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 01:23:00,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 01:23:00,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:23:00,538 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:00,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232052078] [2025-01-09 01:23:00,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232052078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:23:00,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:23:00,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 01:23:00,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142723818] [2025-01-09 01:23:00,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:23:00,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 01:23:00,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:00,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 01:23:00,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 01:23:00,540 INFO L87 Difference]: Start difference. First operand 70 states and 99 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 01:23:00,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:00,721 INFO L93 Difference]: Finished difference Result 119 states and 164 transitions. [2025-01-09 01:23:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 01:23:00,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2025-01-09 01:23:00,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:00,723 INFO L225 Difference]: With dead ends: 119 [2025-01-09 01:23:00,723 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 01:23:00,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 01:23:00,724 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 22 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:00,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 482 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 01:23:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 01:23:00,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 70. [2025-01-09 01:23:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 15 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (19), 17 states have call predecessors, (19), 15 states have call successors, (19) [2025-01-09 01:23:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2025-01-09 01:23:00,729 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 38 [2025-01-09 01:23:00,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:00,729 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2025-01-09 01:23:00,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 01:23:00,730 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2025-01-09 01:23:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 01:23:00,730 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:00,730 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:00,734 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 [2025-01-09 01:23:00,933 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 [2025-01-09 01:23:00,934 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:00,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:00,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1543796545, now seen corresponding path program 1 times [2025-01-09 01:23:00,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:00,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839757868] [2025-01-09 01:23:00,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:00,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:00,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:00,939 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:23:00,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-01-09 01:23:00,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 01:23:01,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 01:23:01,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:01,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:01,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 01:23:01,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 01:23:01,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 01:23:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 01:23:01,500 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:01,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839757868] [2025-01-09 01:23:01,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1839757868] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 01:23:01,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 01:23:01,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2025-01-09 01:23:01,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206586153] [2025-01-09 01:23:01,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 01:23:01,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 01:23:01,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:01,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 01:23:01,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-01-09 01:23:01,501 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-09 01:23:01,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:01,822 INFO L93 Difference]: Finished difference Result 108 states and 152 transitions. [2025-01-09 01:23:01,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 01:23:01,823 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 41 [2025-01-09 01:23:01,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:01,824 INFO L225 Difference]: With dead ends: 108 [2025-01-09 01:23:01,824 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 01:23:01,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-01-09 01:23:01,825 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 36 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:01,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 423 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 01:23:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 01:23:01,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 80. [2025-01-09 01:23:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (23), 20 states have call predecessors, (23), 18 states have call successors, (23) [2025-01-09 01:23:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2025-01-09 01:23:01,831 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 41 [2025-01-09 01:23:01,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:01,832 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2025-01-09 01:23:01,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-09 01:23:01,832 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2025-01-09 01:23:01,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 01:23:01,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:01,833 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:01,836 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 [2025-01-09 01:23:02,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:02,036 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:02,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:02,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1984865999, now seen corresponding path program 1 times [2025-01-09 01:23:02,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:02,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558800328] [2025-01-09 01:23:02,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:02,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:02,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:02,039 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:23:02,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-01-09 01:23:02,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 01:23:02,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 01:23:02,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:02,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:02,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 01:23:02,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:02,098 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 01:23:02,098 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:23:02,099 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:02,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558800328] [2025-01-09 01:23:02,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558800328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:23:02,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:23:02,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 01:23:02,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13811511] [2025-01-09 01:23:02,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:23:02,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 01:23:02,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:02,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 01:23:02,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 01:23:02,099 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 01:23:02,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:02,117 INFO L93 Difference]: Finished difference Result 83 states and 116 transitions. [2025-01-09 01:23:02,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 01:23:02,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2025-01-09 01:23:02,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:02,118 INFO L225 Difference]: With dead ends: 83 [2025-01-09 01:23:02,118 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 01:23:02,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 01:23:02,118 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:02,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 01:23:02,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 01:23:02,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2025-01-09 01:23:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (23), 20 states have call predecessors, (23), 18 states have call successors, (23) [2025-01-09 01:23:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2025-01-09 01:23:02,126 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 43 [2025-01-09 01:23:02,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:02,126 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2025-01-09 01:23:02,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 01:23:02,126 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2025-01-09 01:23:02,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 01:23:02,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:02,127 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:02,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-01-09 01:23:02,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:02,333 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:02,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:02,334 INFO L85 PathProgramCache]: Analyzing trace with hash 2091675908, now seen corresponding path program 1 times [2025-01-09 01:23:02,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:02,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799390612] [2025-01-09 01:23:02,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:02,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:02,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:02,336 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:23:02,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-01-09 01:23:02,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 01:23:02,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 01:23:02,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:02,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:02,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 01:23:02,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 01:23:02,411 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:23:02,411 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:02,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799390612] [2025-01-09 01:23:02,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799390612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:23:02,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:23:02,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 01:23:02,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540743772] [2025-01-09 01:23:02,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:23:02,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 01:23:02,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:02,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 01:23:02,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:23:02,412 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 01:23:02,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:02,448 INFO L93 Difference]: Finished difference Result 109 states and 153 transitions. [2025-01-09 01:23:02,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 01:23:02,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2025-01-09 01:23:02,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:02,449 INFO L225 Difference]: With dead ends: 109 [2025-01-09 01:23:02,450 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 01:23:02,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:23:02,451 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:02,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 01:23:02,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 01:23:02,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-09 01:23:02,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.25) internal successors, (75), 59 states have internal predecessors, (75), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (28), 22 states have call predecessors, (28), 18 states have call successors, (28) [2025-01-09 01:23:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 121 transitions. [2025-01-09 01:23:02,461 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 121 transitions. Word has length 46 [2025-01-09 01:23:02,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:02,461 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 121 transitions. [2025-01-09 01:23:02,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 01:23:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 121 transitions. [2025-01-09 01:23:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 01:23:02,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:02,462 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:02,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-01-09 01:23:02,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:02,663 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:02,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:02,663 INFO L85 PathProgramCache]: Analyzing trace with hash 811812230, now seen corresponding path program 1 times [2025-01-09 01:23:02,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:02,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373797341] [2025-01-09 01:23:02,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:02,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:02,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:02,666 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:23:02,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-01-09 01:23:02,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 01:23:02,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 01:23:02,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:02,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:02,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 01:23:02,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 01:23:03,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 01:23:03,662 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 01:23:03,662 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:03,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373797341] [2025-01-09 01:23:03,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373797341] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 01:23:03,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 01:23:03,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2025-01-09 01:23:03,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818177238] [2025-01-09 01:23:03,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 01:23:03,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 01:23:03,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:03,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 01:23:03,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-01-09 01:23:03,664 INFO L87 Difference]: Start difference. First operand 84 states and 121 transitions. Second operand has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 7 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2025-01-09 01:23:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:05,102 INFO L93 Difference]: Finished difference Result 147 states and 202 transitions. [2025-01-09 01:23:05,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 01:23:05,102 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 7 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) Word has length 46 [2025-01-09 01:23:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:05,104 INFO L225 Difference]: With dead ends: 147 [2025-01-09 01:23:05,104 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 01:23:05,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2025-01-09 01:23:05,105 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 80 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:05,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 752 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 01:23:05,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 01:23:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2025-01-09 01:23:05,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.25) internal successors, (75), 59 states have internal predecessors, (75), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (26), 22 states have call predecessors, (26), 18 states have call successors, (26) [2025-01-09 01:23:05,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2025-01-09 01:23:05,117 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 46 [2025-01-09 01:23:05,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:05,117 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2025-01-09 01:23:05,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 7 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2025-01-09 01:23:05,118 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2025-01-09 01:23:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 01:23:05,118 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:05,118 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:05,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-01-09 01:23:05,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:05,319 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:05,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:05,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1391880374, now seen corresponding path program 1 times [2025-01-09 01:23:05,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:05,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232538815] [2025-01-09 01:23:05,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:05,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:05,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:05,323 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:23:05,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-01-09 01:23:05,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 01:23:05,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 01:23:05,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:05,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:05,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 01:23:05,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 01:23:05,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 01:23:06,102 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 01:23:06,102 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:06,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232538815] [2025-01-09 01:23:06,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232538815] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 01:23:06,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 01:23:06,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2025-01-09 01:23:06,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741948859] [2025-01-09 01:23:06,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 01:23:06,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 01:23:06,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:06,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 01:23:06,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 01:23:06,110 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 01:23:06,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:06,331 INFO L93 Difference]: Finished difference Result 104 states and 141 transitions. [2025-01-09 01:23:06,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 01:23:06,332 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) Word has length 48 [2025-01-09 01:23:06,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:06,334 INFO L225 Difference]: With dead ends: 104 [2025-01-09 01:23:06,334 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 01:23:06,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-01-09 01:23:06,334 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 41 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:06,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 446 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 01:23:06,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 01:23:06,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2025-01-09 01:23:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 57 states have internal predecessors, (69), 17 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (24), 19 states have call predecessors, (24), 17 states have call successors, (24) [2025-01-09 01:23:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 110 transitions. [2025-01-09 01:23:06,341 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 110 transitions. Word has length 48 [2025-01-09 01:23:06,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:06,342 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 110 transitions. [2025-01-09 01:23:06,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 01:23:06,342 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 110 transitions. [2025-01-09 01:23:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 01:23:06,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:06,342 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:06,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-01-09 01:23:06,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:06,543 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:06,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:06,544 INFO L85 PathProgramCache]: Analyzing trace with hash 337284324, now seen corresponding path program 1 times [2025-01-09 01:23:06,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:06,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524908725] [2025-01-09 01:23:06,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:06,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:06,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:06,547 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:23:06,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-01-09 01:23:06,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 01:23:06,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 01:23:06,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:06,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:06,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 01:23:06,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 01:23:06,620 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:23:06,620 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:06,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524908725] [2025-01-09 01:23:06,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524908725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:23:06,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:23:06,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 01:23:06,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588559380] [2025-01-09 01:23:06,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:23:06,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 01:23:06,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:06,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 01:23:06,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:23:06,622 INFO L87 Difference]: Start difference. First operand 79 states and 110 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 01:23:06,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:06,652 INFO L93 Difference]: Finished difference Result 111 states and 153 transitions. [2025-01-09 01:23:06,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 01:23:06,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2025-01-09 01:23:06,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:06,657 INFO L225 Difference]: With dead ends: 111 [2025-01-09 01:23:06,657 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 01:23:06,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:23:06,658 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:06,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 189 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 01:23:06,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 01:23:06,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-01-09 01:23:06,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 59 states have internal predecessors, (71), 17 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (29), 20 states have call predecessors, (29), 17 states have call successors, (29) [2025-01-09 01:23:06,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 117 transitions. [2025-01-09 01:23:06,664 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 117 transitions. Word has length 48 [2025-01-09 01:23:06,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:06,664 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 117 transitions. [2025-01-09 01:23:06,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 01:23:06,664 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 117 transitions. [2025-01-09 01:23:06,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 01:23:06,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:06,665 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:06,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-01-09 01:23:06,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:06,866 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:06,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:06,866 INFO L85 PathProgramCache]: Analyzing trace with hash -942579354, now seen corresponding path program 1 times [2025-01-09 01:23:06,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:06,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757685628] [2025-01-09 01:23:06,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:06,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:06,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:06,869 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:23:06,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-01-09 01:23:06,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 01:23:06,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 01:23:06,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:06,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:06,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 01:23:06,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 01:23:07,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 01:23:07,685 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:07,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757685628] [2025-01-09 01:23:07,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1757685628] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 01:23:07,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [38020680] [2025-01-09 01:23:07,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:07,686 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 01:23:07,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 01:23:07,702 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 01:23:07,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2025-01-09 01:23:07,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 01:23:07,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 01:23:07,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:07,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:07,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 01:23:07,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 01:23:08,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 01:23:08,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [38020680] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 01:23:08,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 01:23:08,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 13 [2025-01-09 01:23:08,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854381766] [2025-01-09 01:23:08,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 01:23:08,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 01:23:08,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:08,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 01:23:08,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-01-09 01:23:08,147 INFO L87 Difference]: Start difference. First operand 82 states and 117 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 01:23:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:08,593 INFO L93 Difference]: Finished difference Result 104 states and 145 transitions. [2025-01-09 01:23:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 01:23:08,593 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2025-01-09 01:23:08,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:08,594 INFO L225 Difference]: With dead ends: 104 [2025-01-09 01:23:08,594 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 01:23:08,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-01-09 01:23:08,595 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 43 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:08,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 437 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 01:23:08,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 01:23:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2025-01-09 01:23:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 18 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (31), 22 states have call predecessors, (31), 18 states have call successors, (31) [2025-01-09 01:23:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2025-01-09 01:23:08,600 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 48 [2025-01-09 01:23:08,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:08,600 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2025-01-09 01:23:08,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 01:23:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2025-01-09 01:23:08,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 01:23:08,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:08,600 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:08,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2025-01-09 01:23:08,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2025-01-09 01:23:09,004 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,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 01:23:09,005 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:09,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:09,005 INFO L85 PathProgramCache]: Analyzing trace with hash 457492615, now seen corresponding path program 1 times [2025-01-09 01:23:09,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:09,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958166518] [2025-01-09 01:23:09,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:09,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:09,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:09,009 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:23:09,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-01-09 01:23:09,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 01:23:09,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 01:23:09,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:09,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:09,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 01:23:09,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 01:23:09,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 01:23:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 01:23:09,313 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:09,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958166518] [2025-01-09 01:23:09,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958166518] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 01:23:09,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 01:23:09,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2025-01-09 01:23:09,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158797722] [2025-01-09 01:23:09,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 01:23:09,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 01:23:09,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:09,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 01:23:09,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-09 01:23:09,314 INFO L87 Difference]: Start difference. First operand 85 states and 122 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 01:23:09,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:09,567 INFO L93 Difference]: Finished difference Result 117 states and 153 transitions. [2025-01-09 01:23:09,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 01:23:09,567 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 48 [2025-01-09 01:23:09,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:09,570 INFO L225 Difference]: With dead ends: 117 [2025-01-09 01:23:09,570 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 01:23:09,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-01-09 01:23:09,570 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 40 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:09,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 454 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 01:23:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 01:23:09,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2025-01-09 01:23:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 14 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (23), 16 states have call predecessors, (23), 14 states have call successors, (23) [2025-01-09 01:23:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2025-01-09 01:23:09,576 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 48 [2025-01-09 01:23:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:09,577 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2025-01-09 01:23:09,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 01:23:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2025-01-09 01:23:09,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 01:23:09,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:09,578 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:09,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2025-01-09 01:23:09,778 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 [2025-01-09 01:23:09,779 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:09,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:09,779 INFO L85 PathProgramCache]: Analyzing trace with hash 804821263, now seen corresponding path program 1 times [2025-01-09 01:23:09,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:09,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337811405] [2025-01-09 01:23:09,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:09,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:09,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:09,782 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) [2025-01-09 01:23:09,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 (19)] Waiting until timeout for monitored process [2025-01-09 01:23:09,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 01:23:09,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 01:23:09,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:09,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:09,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 01:23:09,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 01:23:09,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 01:23:10,061 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 01:23:10,061 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:10,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337811405] [2025-01-09 01:23:10,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337811405] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 01:23:10,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 01:23:10,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2025-01-09 01:23:10,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471219309] [2025-01-09 01:23:10,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 01:23:10,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 01:23:10,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:10,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 01:23:10,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 01:23:10,063 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 01:23:10,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:10,234 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2025-01-09 01:23:10,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 01:23:10,237 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 48 [2025-01-09 01:23:10,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:10,237 INFO L225 Difference]: With dead ends: 86 [2025-01-09 01:23:10,237 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 01:23:10,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-01-09 01:23:10,238 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 11 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:10,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 491 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 01:23:10,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 01:23:10,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2025-01-09 01:23:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 13 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (22), 15 states have call predecessors, (22), 13 states have call successors, (22) [2025-01-09 01:23:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2025-01-09 01:23:10,242 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 48 [2025-01-09 01:23:10,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:10,242 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2025-01-09 01:23:10,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 01:23:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2025-01-09 01:23:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 01:23:10,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:10,243 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:10,246 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 [2025-01-09 01:23:10,443 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 [2025-01-09 01:23:10,444 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:10,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:10,444 INFO L85 PathProgramCache]: Analyzing trace with hash 355396182, now seen corresponding path program 1 times [2025-01-09 01:23:10,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:10,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869270923] [2025-01-09 01:23:10,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:10,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:10,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:10,446 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:23:10,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2025-01-09 01:23:10,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 01:23:10,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 01:23:10,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:10,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:10,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 01:23:10,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 01:23:10,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:23:10,514 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:10,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869270923] [2025-01-09 01:23:10,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869270923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:23:10,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:23:10,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 01:23:10,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307299431] [2025-01-09 01:23:10,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:23:10,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 01:23:10,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:10,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 01:23:10,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:23:10,515 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 01:23:10,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:10,529 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2025-01-09 01:23:10,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 01:23:10,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2025-01-09 01:23:10,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:10,530 INFO L225 Difference]: With dead ends: 98 [2025-01-09 01:23:10,530 INFO L226 Difference]: Without dead ends: 72 [2025-01-09 01:23:10,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:23:10,531 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:10,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 01:23:10,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-01-09 01:23:10,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2025-01-09 01:23:10,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 13 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (22), 15 states have call predecessors, (22), 13 states have call successors, (22) [2025-01-09 01:23:10,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2025-01-09 01:23:10,534 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 49 [2025-01-09 01:23:10,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:10,534 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2025-01-09 01:23:10,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 01:23:10,534 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2025-01-09 01:23:10,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 01:23:10,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:10,535 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:10,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2025-01-09 01:23:10,735 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 [2025-01-09 01:23:10,736 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:10,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:10,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1223541664, now seen corresponding path program 1 times [2025-01-09 01:23:10,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:10,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878359479] [2025-01-09 01:23:10,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:10,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:10,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:10,738 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) [2025-01-09 01:23:10,739 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 [2025-01-09 01:23:10,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 01:23:10,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 01:23:10,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:10,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:10,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 01:23:10,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 01:23:10,801 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:23:10,801 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:10,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878359479] [2025-01-09 01:23:10,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878359479] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:23:10,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:23:10,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 01:23:10,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600187410] [2025-01-09 01:23:10,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:23:10,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 01:23:10,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:10,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 01:23:10,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:23:10,802 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 01:23:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:10,829 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2025-01-09 01:23:10,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 01:23:10,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2025-01-09 01:23:10,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:10,830 INFO L225 Difference]: With dead ends: 96 [2025-01-09 01:23:10,830 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 01:23:10,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:23:10,831 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:10,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 01:23:10,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 01:23:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2025-01-09 01:23:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 49 states have internal predecessors, (55), 13 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (18), 15 states have call predecessors, (18), 13 states have call successors, (18) [2025-01-09 01:23:10,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2025-01-09 01:23:10,837 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 50 [2025-01-09 01:23:10,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:10,837 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2025-01-09 01:23:10,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 01:23:10,837 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2025-01-09 01:23:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 01:23:10,838 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:10,838 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:10,843 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 [2025-01-09 01:23:11,038 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 [2025-01-09 01:23:11,038 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:11,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:11,039 INFO L85 PathProgramCache]: Analyzing trace with hash 226469311, now seen corresponding path program 1 times [2025-01-09 01:23:11,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:11,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138517469] [2025-01-09 01:23:11,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:11,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:11,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:11,042 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:23:11,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2025-01-09 01:23:11,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 01:23:11,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 01:23:11,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:11,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:11,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 01:23:11,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:11,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 01:23:11,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-09 01:23:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 01:23:11,490 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:23:11,490 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:11,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138517469] [2025-01-09 01:23:11,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138517469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:23:11,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:23:11,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 01:23:11,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751299767] [2025-01-09 01:23:11,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:23:11,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 01:23:11,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:11,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 01:23:11,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 01:23:11,491 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 01:23:12,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:12,117 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2025-01-09 01:23:12,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 01:23:12,118 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2025-01-09 01:23:12,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:12,118 INFO L225 Difference]: With dead ends: 70 [2025-01-09 01:23:12,118 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 01:23:12,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-01-09 01:23:12,119 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:12,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 350 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 01:23:12,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 01:23:12,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2025-01-09 01:23:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2025-01-09 01:23:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2025-01-09 01:23:12,121 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 50 [2025-01-09 01:23:12,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:12,121 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2025-01-09 01:23:12,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 01:23:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2025-01-09 01:23:12,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 01:23:12,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:12,122 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:12,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2025-01-09 01:23:12,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:12,322 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:12,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:12,323 INFO L85 PathProgramCache]: Analyzing trace with hash 66041491, now seen corresponding path program 1 times [2025-01-09 01:23:12,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:12,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502803271] [2025-01-09 01:23:12,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:12,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:12,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:12,325 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:23:12,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 (23)] Waiting until timeout for monitored process [2025-01-09 01:23:12,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 01:23:12,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 01:23:12,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:12,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:12,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 01:23:12,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:12,748 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 01:23:12,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 01:23:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 01:23:13,467 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:13,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502803271] [2025-01-09 01:23:13,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502803271] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 01:23:13,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 01:23:13,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2025-01-09 01:23:13,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010701109] [2025-01-09 01:23:13,468 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 01:23:13,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 01:23:13,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:13,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 01:23:13,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-01-09 01:23:13,470 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 01:23:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:14,017 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2025-01-09 01:23:14,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 01:23:14,018 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 55 [2025-01-09 01:23:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:14,025 INFO L225 Difference]: With dead ends: 78 [2025-01-09 01:23:14,025 INFO L226 Difference]: Without dead ends: 47 [2025-01-09 01:23:14,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2025-01-09 01:23:14,026 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 46 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:14,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 376 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 01:23:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-09 01:23:14,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2025-01-09 01:23:14,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2025-01-09 01:23:14,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2025-01-09 01:23:14,029 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 55 [2025-01-09 01:23:14,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:14,029 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2025-01-09 01:23:14,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 01:23:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2025-01-09 01:23:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 01:23:14,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:14,030 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:14,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2025-01-09 01:23:14,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:14,230 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:14,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:14,231 INFO L85 PathProgramCache]: Analyzing trace with hash -2091826422, now seen corresponding path program 1 times [2025-01-09 01:23:14,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:14,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712929279] [2025-01-09 01:23:14,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:14,231 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:14,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:14,233 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:23:14,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2025-01-09 01:23:14,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 01:23:14,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 01:23:14,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:14,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:14,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 01:23:14,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:14,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 01:23:14,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-09 01:23:14,439 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 01:23:14,439 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:23:14,439 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:14,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712929279] [2025-01-09 01:23:14,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712929279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:23:14,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:23:14,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 01:23:14,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833854968] [2025-01-09 01:23:14,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:23:14,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 01:23:14,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:14,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 01:23:14,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 01:23:14,440 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 01:23:14,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:14,708 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2025-01-09 01:23:14,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 01:23:14,708 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 60 [2025-01-09 01:23:14,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:14,709 INFO L225 Difference]: With dead ends: 66 [2025-01-09 01:23:14,709 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 01:23:14,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 01:23:14,710 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:14,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 263 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 01:23:14,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 01:23:14,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-01-09 01:23:14,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-01-09 01:23:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2025-01-09 01:23:14,713 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 60 [2025-01-09 01:23:14,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:14,713 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2025-01-09 01:23:14,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 01:23:14,713 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2025-01-09 01:23:14,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 01:23:14,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:14,714 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:14,722 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 [2025-01-09 01:23:14,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:14,917 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:14,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:14,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1407678904, now seen corresponding path program 1 times [2025-01-09 01:23:14,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:14,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58929882] [2025-01-09 01:23:14,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:14,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:14,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:14,920 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:23:14,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2025-01-09 01:23:14,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 01:23:14,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 01:23:14,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:14,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:14,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 01:23:14,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 01:23:15,179 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:23:15,179 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:15,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58929882] [2025-01-09 01:23:15,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58929882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:23:15,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:23:15,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 01:23:15,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161230844] [2025-01-09 01:23:15,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:23:15,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 01:23:15,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:15,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 01:23:15,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 01:23:15,180 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 01:23:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:15,573 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2025-01-09 01:23:15,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 01:23:15,573 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 61 [2025-01-09 01:23:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:15,574 INFO L225 Difference]: With dead ends: 68 [2025-01-09 01:23:15,574 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 01:23:15,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 01:23:15,575 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:15,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 270 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 01:23:15,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 01:23:15,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2025-01-09 01:23:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-01-09 01:23:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2025-01-09 01:23:15,579 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 61 [2025-01-09 01:23:15,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:15,579 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2025-01-09 01:23:15,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 01:23:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2025-01-09 01:23:15,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 01:23:15,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:15,580 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:15,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2025-01-09 01:23:15,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:15,784 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:15,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:15,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1495708466, now seen corresponding path program 1 times [2025-01-09 01:23:15,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:15,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1811705028] [2025-01-09 01:23:15,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:15,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:15,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:15,788 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:23:15,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2025-01-09 01:23:15,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 01:23:15,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 01:23:15,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:15,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:15,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 01:23:15,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 01:23:16,003 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:23:16,003 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:16,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1811705028] [2025-01-09 01:23:16,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1811705028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:23:16,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:23:16,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 01:23:16,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521302995] [2025-01-09 01:23:16,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:23:16,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 01:23:16,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:16,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 01:23:16,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 01:23:16,004 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 01:23:16,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:16,393 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2025-01-09 01:23:16,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 01:23:16,396 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2025-01-09 01:23:16,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:16,396 INFO L225 Difference]: With dead ends: 68 [2025-01-09 01:23:16,396 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 01:23:16,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 01:23:16,397 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:16,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 270 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 01:23:16,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 01:23:16,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2025-01-09 01:23:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-01-09 01:23:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2025-01-09 01:23:16,399 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 62 [2025-01-09 01:23:16,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:16,399 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2025-01-09 01:23:16,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 01:23:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2025-01-09 01:23:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 01:23:16,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:16,400 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:16,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2025-01-09 01:23:16,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:16,604 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:16,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:16,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1025306500, now seen corresponding path program 1 times [2025-01-09 01:23:16,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:16,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799447651] [2025-01-09 01:23:16,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:16,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:16,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:16,606 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:23:16,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 (27)] Waiting until timeout for monitored process [2025-01-09 01:23:16,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 01:23:16,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 01:23:16,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:16,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:16,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 01:23:16,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 01:23:16,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:23:16,767 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:16,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799447651] [2025-01-09 01:23:16,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799447651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:23:16,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:23:16,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 01:23:16,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106190256] [2025-01-09 01:23:16,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:23:16,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 01:23:16,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:16,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 01:23:16,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 01:23:16,768 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 01:23:16,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:16,996 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2025-01-09 01:23:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 01:23:16,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2025-01-09 01:23:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:16,996 INFO L225 Difference]: With dead ends: 65 [2025-01-09 01:23:16,996 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 01:23:16,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 01:23:17,001 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:17,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 262 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 01:23:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 01:23:17,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2025-01-09 01:23:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 01:23:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2025-01-09 01:23:17,003 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 63 [2025-01-09 01:23:17,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:17,003 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2025-01-09 01:23:17,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 01:23:17,003 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2025-01-09 01:23:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 01:23:17,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:17,003 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:17,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2025-01-09 01:23:17,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:17,204 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:17,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:17,204 INFO L85 PathProgramCache]: Analyzing trace with hash 973596735, now seen corresponding path program 1 times [2025-01-09 01:23:17,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:17,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173184917] [2025-01-09 01:23:17,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:17,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:17,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:17,208 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 01:23:17,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2025-01-09 01:23:17,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 01:23:17,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 01:23:17,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:17,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:17,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 01:23:17,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:17,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 01:23:17,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-09 01:23:17,432 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 01:23:17,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 01:23:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 01:23:17,676 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:17,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173184917] [2025-01-09 01:23:17,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173184917] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 01:23:17,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 01:23:17,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-01-09 01:23:17,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761047934] [2025-01-09 01:23:17,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 01:23:17,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 01:23:17,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:17,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 01:23:17,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-01-09 01:23:17,677 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2025-01-09 01:23:18,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:18,247 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2025-01-09 01:23:18,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 01:23:18,248 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) Word has length 63 [2025-01-09 01:23:18,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:18,248 INFO L225 Difference]: With dead ends: 64 [2025-01-09 01:23:18,248 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 01:23:18,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-01-09 01:23:18,249 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 19 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:18,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 350 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 01:23:18,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 01:23:18,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-01-09 01:23:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2025-01-09 01:23:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2025-01-09 01:23:18,254 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 63 [2025-01-09 01:23:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:18,254 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2025-01-09 01:23:18,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2025-01-09 01:23:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2025-01-09 01:23:18,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 01:23:18,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:18,254 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:18,259 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 [2025-01-09 01:23:18,454 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 [2025-01-09 01:23:18,455 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:18,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:18,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1192451453, now seen corresponding path program 1 times [2025-01-09 01:23:18,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:18,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8343846] [2025-01-09 01:23:18,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:18,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:18,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:18,458 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) [2025-01-09 01:23:18,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 (29)] Waiting until timeout for monitored process [2025-01-09 01:23:18,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 01:23:18,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 01:23:18,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:18,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:18,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 01:23:18,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:18,533 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 01:23:18,533 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:23:18,533 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:18,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8343846] [2025-01-09 01:23:18,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8343846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:23:18,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:23:18,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 01:23:18,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762963204] [2025-01-09 01:23:18,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:23:18,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 01:23:18,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:18,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 01:23:18,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:23:18,535 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 01:23:18,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:18,562 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2025-01-09 01:23:18,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 01:23:18,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2025-01-09 01:23:18,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:18,563 INFO L225 Difference]: With dead ends: 66 [2025-01-09 01:23:18,563 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 01:23:18,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:23:18,563 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:18,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 01:23:18,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 01:23:18,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-09 01:23:18,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 01:23:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2025-01-09 01:23:18,567 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 63 [2025-01-09 01:23:18,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:18,567 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2025-01-09 01:23:18,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 01:23:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2025-01-09 01:23:18,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 01:23:18,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:23:18,567 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:18,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 (29)] Ended with exit code 0 [2025-01-09 01:23:18,768 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 [2025-01-09 01:23:18,768 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:23:18,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:23:18,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1672792497, now seen corresponding path program 1 times [2025-01-09 01:23:18,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:23:18,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428119716] [2025-01-09 01:23:18,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:23:18,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:23:18,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:23:18,772 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) [2025-01-09 01:23:18,773 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 [2025-01-09 01:23:18,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 01:23:18,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 01:23:18,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:23:18,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:23:18,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 01:23:18,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:23:18,970 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 01:23:18,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 01:23:20,649 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 01:23:20,649 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:23:20,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428119716] [2025-01-09 01:23:20,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428119716] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 01:23:20,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 01:23:20,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-01-09 01:23:20,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353284746] [2025-01-09 01:23:20,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 01:23:20,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 01:23:20,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:23:20,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 01:23:20,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-01-09 01:23:20,656 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 01:23:20,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:23:20,767 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2025-01-09 01:23:20,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 01:23:20,768 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Word has length 64 [2025-01-09 01:23:20,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:23:20,769 INFO L225 Difference]: With dead ends: 46 [2025-01-09 01:23:20,769 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 01:23:20,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-01-09 01:23:20,770 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 01:23:20,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 267 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 01:23:20,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 01:23:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 01:23:20,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 01:23:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 01:23:20,774 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2025-01-09 01:23:20,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:23:20,774 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 01:23:20,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 01:23:20,774 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 01:23:20,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 01:23:20,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-01-09 01:23:20,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-09 01:23:20,785 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 [2025-01-09 01:23:20,977 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 [2025-01-09 01:23:20,981 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:23:20,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 01:23:21,721 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 01:23:21,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:23:21 BoogieIcfgContainer [2025-01-09 01:23:21,729 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 01:23:21,729 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 01:23:21,729 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 01:23:21,729 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 01:23:21,730 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:22:57" (3/4) ... [2025-01-09 01:23:21,731 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 01:23:21,737 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_float [2025-01-09 01:23:21,737 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2025-01-09 01:23:21,741 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-01-09 01:23:21,742 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-09 01:23:21,742 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 01:23:21,742 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 01:23:21,762 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x) [2025-01-09 01:23:21,783 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x) [2025-01-09 01:23:21,812 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 01:23:21,813 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 01:23:21,813 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 01:23:21,814 INFO L158 Benchmark]: Toolchain (without parser) took 25344.66ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 117.0MB in the beginning and 184.0MB in the end (delta: -67.0MB). Peak memory consumption was 124.3MB. Max. memory is 16.1GB. [2025-01-09 01:23:21,814 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 01:23:21,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.98ms. Allocated memory is still 142.6MB. Free memory was 116.8MB in the beginning and 104.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 01:23:21,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.05ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 103.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 01:23:21,815 INFO L158 Benchmark]: Boogie Preprocessor took 46.89ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 101.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 01:23:21,815 INFO L158 Benchmark]: RCFGBuilder took 299.78ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 86.5MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 01:23:21,816 INFO L158 Benchmark]: TraceAbstraction took 24684.96ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 85.9MB in the beginning and 72.8MB in the end (delta: 13.2MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. [2025-01-09 01:23:21,816 INFO L158 Benchmark]: Witness Printer took 84.02ms. Allocated memory is still 218.1MB. Free memory was 72.8MB in the beginning and 184.0MB in the end (delta: -111.3MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2025-01-09 01:23:21,818 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.98ms. Allocated memory is still 142.6MB. Free memory was 116.8MB in the beginning and 104.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.05ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 103.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.89ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 101.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 299.78ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 86.5MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24684.96ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 85.9MB in the beginning and 72.8MB in the end (delta: 13.2MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. * Witness Printer took 84.02ms. Allocated memory is still 218.1MB. Free memory was 72.8MB in the beginning and 184.0MB in the end (delta: -111.3MB). Peak memory consumption was 8.9MB. 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 - PositiveResult [Line: 76]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 82]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 53 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 23.9s, OverallIterations: 28, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 524 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 466 mSDsluCounter, 8514 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6947 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3791 IncrementalHoareTripleChecker+Invalid, 3902 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 1567 mSDtfsCounter, 3791 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1915 GetRequests, 1646 SyntacticMatches, 4 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=15, InterpolantAutomatonStates: 225, 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, 28 MinimizatonAttempts, 123 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1782 ConstructedInterpolants, 12 QuantifiedInterpolants, 6008 SizeOfPredicates, 47 NumberOfNonLiveVariables, 3124 ConjunctsInSsa, 304 ConjunctsInUnsatCore, 38 InterpolantComputations, 18 PerfectInterpolantSequences, 948/1076 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (\old(x) == x) RESULT: Ultimate proved your program to be correct! [2025-01-09 01:23:21,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE