./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67160a6df79d1049c73d7b3dbc4aa323b185d65b8c91424febe1ccb6e4daf12a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:27:05,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:27:05,346 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:27:05,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:27:05,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:27:05,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:27:05,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:27:05,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:27:05,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:27:05,382 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:27:05,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:27:05,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:27:05,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:27:05,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:27:05,383 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:27:05,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:27:05,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:27:05,384 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:27:05,384 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:27:05,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:27:05,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:27:05,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:27:05,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:27:05,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:27:05,385 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:27:05,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:27:05,385 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:27:05,385 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:27:05,385 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:27:05,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:27:05,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:27:05,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:27:05,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:27:05,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:27:05,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:27:05,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:27:05,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:27:05,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:27:05,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:27:05,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:27:05,387 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:27:05,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:27:05,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:27:05,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:27:05,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:27:05,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:27:05,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:27:05,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:27:05,388 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 -> 67160a6df79d1049c73d7b3dbc4aa323b185d65b8c91424febe1ccb6e4daf12a [2025-01-09 15:27:05,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:27:05,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:27:05,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:27:05,664 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:27:05,665 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:27:05,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i [2025-01-09 15:27:06,776 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a84398d12/7ff88dcb9b2c41879db1119bce4e9625/FLAGef945373d [2025-01-09 15:27:07,036 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:27:07,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i [2025-01-09 15:27:07,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a84398d12/7ff88dcb9b2c41879db1119bce4e9625/FLAGef945373d [2025-01-09 15:27:07,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a84398d12/7ff88dcb9b2c41879db1119bce4e9625 [2025-01-09 15:27:07,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:27:07,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:27:07,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:27:07,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:27:07,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:27:07,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:27:07" (1/1) ... [2025-01-09 15:27:07,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b277b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:07, skipping insertion in model container [2025-01-09 15:27:07,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:27:07" (1/1) ... [2025-01-09 15:27:07,360 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:27:07,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i[916,929] [2025-01-09 15:27:07,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:27:07,510 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:27:07,517 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i[916,929] [2025-01-09 15:27:07,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:27:07,571 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:27:07,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:07 WrapperNode [2025-01-09 15:27:07,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:27:07,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:27:07,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:27:07,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:27:07,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:07" (1/1) ... [2025-01-09 15:27:07,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:07" (1/1) ... [2025-01-09 15:27:07,625 INFO L138 Inliner]: procedures = 29, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 511 [2025-01-09 15:27:07,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:27:07,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:27:07,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:27:07,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:27:07,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:07" (1/1) ... [2025-01-09 15:27:07,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:07" (1/1) ... [2025-01-09 15:27:07,642 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:07" (1/1) ... [2025-01-09 15:27:07,658 INFO L175 MemorySlicer]: Split 133 memory accesses to 5 slices as follows [2, 10, 6, 41, 74]. 56 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 2, 3, 8]. The 17 writes are split as follows [0, 1, 2, 3, 11]. [2025-01-09 15:27:07,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:07" (1/1) ... [2025-01-09 15:27:07,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:07" (1/1) ... [2025-01-09 15:27:07,672 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:07" (1/1) ... [2025-01-09 15:27:07,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:07" (1/1) ... [2025-01-09 15:27:07,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:07" (1/1) ... [2025-01-09 15:27:07,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:07" (1/1) ... [2025-01-09 15:27:07,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:07" (1/1) ... [2025-01-09 15:27:07,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:27:07,704 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:27:07,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:27:07,704 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:27:07,705 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:07" (1/1) ... [2025-01-09 15:27:07,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:27:07,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:07,735 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:27:07,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:27:07,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:27:07,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:27:07,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:27:07,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:27:07,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:27:07,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:27:07,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:27:07,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:27:07,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:27:07,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:27:07,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:27:07,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:27:07,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:27:07,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:27:07,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:27:07,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:27:07,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:27:07,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:27:07,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:27:07,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:27:07,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:27:07,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:27:07,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:27:07,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:27:07,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:27:07,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:27:07,759 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:27:07,760 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:27:07,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:27:07,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:27:07,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:27:07,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:27:07,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:27:07,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:27:07,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:27:07,871 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:27:07,872 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:27:08,346 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-01-09 15:27:08,346 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:27:08,357 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:27:08,358 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:27:08,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:27:08 BoogieIcfgContainer [2025-01-09 15:27:08,358 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:27:08,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:27:08,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:27:08,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:27:08,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:27:07" (1/3) ... [2025-01-09 15:27:08,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cb97fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:27:08, skipping insertion in model container [2025-01-09 15:27:08,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:07" (2/3) ... [2025-01-09 15:27:08,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cb97fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:27:08, skipping insertion in model container [2025-01-09 15:27:08,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:27:08" (3/3) ... [2025-01-09 15:27:08,365 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-82.i [2025-01-09 15:27:08,376 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:27:08,377 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-82.i that has 2 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:27:08,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:27:08,431 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;@221c378c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:27:08,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:27:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:27:08,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:27:08,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:08,447 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:08,447 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:08,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:08,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1869068248, now seen corresponding path program 1 times [2025-01-09 15:27:08,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:08,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041062000] [2025-01-09 15:27:08,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:08,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:08,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:27:08,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:27:08,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:08,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:08,745 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 15:27:08,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:08,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041062000] [2025-01-09 15:27:08,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041062000] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:08,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767357961] [2025-01-09 15:27:08,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:08,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:08,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:08,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:27:08,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:27:08,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:27:08,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:27:08,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:08,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:08,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:27:08,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 15:27:08,999 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:09,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767357961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:09,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:27:09,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:27:09,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697074544] [2025-01-09 15:27:09,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:09,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:27:09,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:09,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:27:09,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:27:09,027 INFO L87 Difference]: Start difference. First operand has 114 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:27:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:09,050 INFO L93 Difference]: Finished difference Result 222 states and 341 transitions. [2025-01-09 15:27:09,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:27:09,052 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2025-01-09 15:27:09,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:09,057 INFO L225 Difference]: With dead ends: 222 [2025-01-09 15:27:09,058 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 15:27:09,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:27:09,063 INFO L435 NwaCegarLoop]: 157 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, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:09,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:09,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 15:27:09,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-01-09 15:27:09,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:27:09,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 157 transitions. [2025-01-09 15:27:09,092 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 157 transitions. Word has length 121 [2025-01-09 15:27:09,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:09,093 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 157 transitions. [2025-01-09 15:27:09,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:27:09,093 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 157 transitions. [2025-01-09 15:27:09,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:27:09,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:09,095 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:09,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:27:09,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:27:09,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:09,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:09,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1810102770, now seen corresponding path program 1 times [2025-01-09 15:27:09,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:09,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087403873] [2025-01-09 15:27:09,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:09,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:09,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:27:09,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:27:09,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:09,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:09,530 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:27:09,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:09,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087403873] [2025-01-09 15:27:09,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087403873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:09,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:09,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:27:09,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535161903] [2025-01-09 15:27:09,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:09,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:27:09,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:09,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:27:09,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:09,532 INFO L87 Difference]: Start difference. First operand 111 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:27:09,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:09,566 INFO L93 Difference]: Finished difference Result 221 states and 314 transitions. [2025-01-09 15:27:09,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:27:09,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2025-01-09 15:27:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:09,571 INFO L225 Difference]: With dead ends: 221 [2025-01-09 15:27:09,571 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 15:27:09,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:09,573 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:09,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:09,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 15:27:09,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-01-09 15:27:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:27:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2025-01-09 15:27:09,589 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 121 [2025-01-09 15:27:09,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:09,590 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2025-01-09 15:27:09,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:27:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2025-01-09 15:27:09,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:27:09,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:09,592 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:09,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:27:09,592 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:09,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:09,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1133479308, now seen corresponding path program 1 times [2025-01-09 15:27:09,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:09,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150747042] [2025-01-09 15:27:09,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:09,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:09,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:27:09,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:27:09,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:09,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:09,843 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 15:27:09,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:09,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150747042] [2025-01-09 15:27:09,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150747042] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:09,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123970457] [2025-01-09 15:27:09,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:09,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:09,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:09,847 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:27:09,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:27:09,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:27:09,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:27:09,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:09,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:10,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:27:10,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:27:10,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:10,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123970457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:10,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:27:10,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 15:27:10,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164303432] [2025-01-09 15:27:10,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:10,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:27:10,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:10,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:27:10,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:27:10,052 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:10,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:10,081 INFO L93 Difference]: Finished difference Result 226 states and 319 transitions. [2025-01-09 15:27:10,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:27:10,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-01-09 15:27:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:10,083 INFO L225 Difference]: With dead ends: 226 [2025-01-09 15:27:10,086 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 15:27:10,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:27:10,087 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:10,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 451 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:10,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 15:27:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-01-09 15:27:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 99 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:27:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2025-01-09 15:27:10,098 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 121 [2025-01-09 15:27:10,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:10,099 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2025-01-09 15:27:10,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:10,099 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2025-01-09 15:27:10,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:27:10,100 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:10,100 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:10,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:27:10,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:10,301 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:10,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:10,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1813537678, now seen corresponding path program 1 times [2025-01-09 15:27:10,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:10,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777625589] [2025-01-09 15:27:10,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:10,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:10,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:27:10,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:27:10,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:10,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:10,468 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 15:27:10,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:10,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777625589] [2025-01-09 15:27:10,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777625589] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:10,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907636334] [2025-01-09 15:27:10,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:10,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:10,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:10,473 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:27:10,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 15:27:10,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:27:10,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:27:10,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:10,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:10,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:27:10,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:10,655 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:27:10,655 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:10,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907636334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:10,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:27:10,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 15:27:10,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231256559] [2025-01-09 15:27:10,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:10,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:27:10,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:10,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:27:10,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:27:10,659 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:10,683 INFO L93 Difference]: Finished difference Result 230 states and 323 transitions. [2025-01-09 15:27:10,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:27:10,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-01-09 15:27:10,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:10,687 INFO L225 Difference]: With dead ends: 230 [2025-01-09 15:27:10,687 INFO L226 Difference]: Without dead ends: 118 [2025-01-09 15:27:10,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:27:10,688 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:10,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:10,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-09 15:27:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-01-09 15:27:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.3366336633663367) internal successors, (135), 101 states have internal predecessors, (135), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:27:10,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 163 transitions. [2025-01-09 15:27:10,701 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 163 transitions. Word has length 121 [2025-01-09 15:27:10,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:10,701 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 163 transitions. [2025-01-09 15:27:10,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:10,702 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 163 transitions. [2025-01-09 15:27:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:27:10,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:10,704 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:10,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 15:27:10,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:10,905 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:10,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:10,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1815384720, now seen corresponding path program 1 times [2025-01-09 15:27:10,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:10,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688594537] [2025-01-09 15:27:10,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:10,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:10,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:27:10,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:27:10,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:10,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 15:27:11,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:11,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688594537] [2025-01-09 15:27:11,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688594537] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:11,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497969421] [2025-01-09 15:27:11,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:11,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:11,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:11,058 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:27:11,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 15:27:11,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:27:11,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:27:11,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:11,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:11,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:27:11,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:27:11,229 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:11,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497969421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:11,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:27:11,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-01-09 15:27:11,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319450379] [2025-01-09 15:27:11,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:11,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:27:11,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:11,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:27:11,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:11,231 INFO L87 Difference]: Start difference. First operand 117 states and 163 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:11,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:11,252 INFO L93 Difference]: Finished difference Result 233 states and 326 transitions. [2025-01-09 15:27:11,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:27:11,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-01-09 15:27:11,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:11,255 INFO L225 Difference]: With dead ends: 233 [2025-01-09 15:27:11,255 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 15:27:11,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:11,256 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:11,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:11,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 15:27:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-01-09 15:27:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3300970873786409) internal successors, (137), 103 states have internal predecessors, (137), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:27:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2025-01-09 15:27:11,268 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 121 [2025-01-09 15:27:11,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:11,268 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2025-01-09 15:27:11,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2025-01-09 15:27:11,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:27:11,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:11,269 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:11,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 15:27:11,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:11,470 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:11,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:11,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1279500002, now seen corresponding path program 1 times [2025-01-09 15:27:11,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:11,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110143897] [2025-01-09 15:27:11,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:11,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:11,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:27:11,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:27:11,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:11,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:11,647 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 15:27:11,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:11,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110143897] [2025-01-09 15:27:11,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110143897] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:11,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644562374] [2025-01-09 15:27:11,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:11,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:11,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:11,650 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:27:11,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 15:27:11,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:27:11,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:27:11,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:11,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:11,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:27:11,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:27:11,831 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:11,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644562374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:11,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:27:11,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-01-09 15:27:11,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793989508] [2025-01-09 15:27:11,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:11,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:27:11,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:11,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:27:11,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:27:11,832 INFO L87 Difference]: Start difference. First operand 119 states and 165 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:11,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:11,854 INFO L93 Difference]: Finished difference Result 238 states and 331 transitions. [2025-01-09 15:27:11,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:27:11,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-01-09 15:27:11,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:11,856 INFO L225 Difference]: With dead ends: 238 [2025-01-09 15:27:11,856 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 15:27:11,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:27:11,857 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:11,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:11,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 15:27:11,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2025-01-09 15:27:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 104 states have (on average 1.3269230769230769) internal successors, (138), 104 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:27:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 166 transitions. [2025-01-09 15:27:11,861 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 166 transitions. Word has length 123 [2025-01-09 15:27:11,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:11,862 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 166 transitions. [2025-01-09 15:27:11,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:11,862 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 166 transitions. [2025-01-09 15:27:11,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:27:11,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:11,863 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:11,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 15:27:12,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:12,063 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:12,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:12,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1036722151, now seen corresponding path program 1 times [2025-01-09 15:27:12,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:12,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207204297] [2025-01-09 15:27:12,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:12,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:12,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:27:12,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:27:12,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:12,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:27:12,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:12,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207204297] [2025-01-09 15:27:12,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207204297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:12,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:12,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:12,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466404534] [2025-01-09 15:27:12,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:12,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:12,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:12,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:12,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:12,530 INFO L87 Difference]: Start difference. First operand 120 states and 166 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:27:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:12,598 INFO L93 Difference]: Finished difference Result 288 states and 398 transitions. [2025-01-09 15:27:12,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:12,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2025-01-09 15:27:12,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:12,600 INFO L225 Difference]: With dead ends: 288 [2025-01-09 15:27:12,600 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 15:27:12,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:12,601 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 63 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:12,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 725 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:12,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 15:27:12,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 130. [2025-01-09 15:27:12,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 114 states have (on average 1.3421052631578947) internal successors, (153), 114 states have internal predecessors, (153), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:27:12,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 181 transitions. [2025-01-09 15:27:12,611 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 181 transitions. Word has length 125 [2025-01-09 15:27:12,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:12,611 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 181 transitions. [2025-01-09 15:27:12,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:27:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 181 transitions. [2025-01-09 15:27:12,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 15:27:12,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:12,612 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:12,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:27:12,612 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:12,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:12,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1847436034, now seen corresponding path program 1 times [2025-01-09 15:27:12,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:12,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686976016] [2025-01-09 15:27:12,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:12,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:12,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 15:27:12,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 15:27:12,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:12,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:27:12,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:12,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686976016] [2025-01-09 15:27:12,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686976016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:12,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:12,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:12,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562673093] [2025-01-09 15:27:12,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:12,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:12,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:12,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:12,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:12,743 INFO L87 Difference]: Start difference. First operand 130 states and 181 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:12,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:12,821 INFO L93 Difference]: Finished difference Result 334 states and 467 transitions. [2025-01-09 15:27:12,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:12,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 126 [2025-01-09 15:27:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:12,823 INFO L225 Difference]: With dead ends: 334 [2025-01-09 15:27:12,823 INFO L226 Difference]: Without dead ends: 207 [2025-01-09 15:27:12,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:12,824 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 75 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:12,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 714 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:27:12,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-01-09 15:27:12,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 175. [2025-01-09 15:27:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 159 states have (on average 1.3773584905660377) internal successors, (219), 159 states have internal predecessors, (219), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:27:12,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 247 transitions. [2025-01-09 15:27:12,830 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 247 transitions. Word has length 126 [2025-01-09 15:27:12,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:12,831 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 247 transitions. [2025-01-09 15:27:12,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:12,831 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 247 transitions. [2025-01-09 15:27:12,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 15:27:12,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:12,832 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:12,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:27:12,832 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:12,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:12,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1975599801, now seen corresponding path program 1 times [2025-01-09 15:27:12,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:12,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231896960] [2025-01-09 15:27:12,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:12,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:12,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 15:27:12,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 15:27:12,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:12,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:14,118 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:27:14,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:14,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231896960] [2025-01-09 15:27:14,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231896960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:14,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:14,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:27:14,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125529649] [2025-01-09 15:27:14,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:14,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:27:14,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:14,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:27:14,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:27:14,120 INFO L87 Difference]: Start difference. First operand 175 states and 247 transitions. Second operand has 12 states, 10 states have (on average 5.9) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:27:14,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:14,519 INFO L93 Difference]: Finished difference Result 488 states and 692 transitions. [2025-01-09 15:27:14,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:27:14,519 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.9) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 126 [2025-01-09 15:27:14,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:14,521 INFO L225 Difference]: With dead ends: 488 [2025-01-09 15:27:14,521 INFO L226 Difference]: Without dead ends: 316 [2025-01-09 15:27:14,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:27:14,522 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 109 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:14,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1624 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:27:14,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-01-09 15:27:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 313. [2025-01-09 15:27:14,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 290 states have (on average 1.396551724137931) internal successors, (405), 291 states have internal predecessors, (405), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:27:14,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 445 transitions. [2025-01-09 15:27:14,532 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 445 transitions. Word has length 126 [2025-01-09 15:27:14,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:14,532 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 445 transitions. [2025-01-09 15:27:14,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.9) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:27:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 445 transitions. [2025-01-09 15:27:14,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 15:27:14,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:14,533 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:14,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:27:14,534 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:14,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:14,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1603809245, now seen corresponding path program 1 times [2025-01-09 15:27:14,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:14,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867990681] [2025-01-09 15:27:14,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:14,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:14,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 15:27:14,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 15:27:14,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:14,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:14,817 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:27:14,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:14,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867990681] [2025-01-09 15:27:14,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867990681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:14,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:14,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:14,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781137992] [2025-01-09 15:27:14,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:14,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:14,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:14,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:14,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:14,819 INFO L87 Difference]: Start difference. First operand 313 states and 445 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:27:14,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:14,869 INFO L93 Difference]: Finished difference Result 696 states and 981 transitions. [2025-01-09 15:27:14,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:14,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 126 [2025-01-09 15:27:14,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:14,872 INFO L225 Difference]: With dead ends: 696 [2025-01-09 15:27:14,872 INFO L226 Difference]: Without dead ends: 386 [2025-01-09 15:27:14,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:14,874 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 134 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:14,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 740 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:14,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-01-09 15:27:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 293. [2025-01-09 15:27:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 270 states have (on average 1.3814814814814815) internal successors, (373), 271 states have internal predecessors, (373), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:27:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 413 transitions. [2025-01-09 15:27:14,884 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 413 transitions. Word has length 126 [2025-01-09 15:27:14,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:14,885 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 413 transitions. [2025-01-09 15:27:14,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:27:14,885 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 413 transitions. [2025-01-09 15:27:14,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 15:27:14,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:14,886 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:14,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:27:14,886 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:14,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:14,887 INFO L85 PathProgramCache]: Analyzing trace with hash -498672181, now seen corresponding path program 1 times [2025-01-09 15:27:14,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:14,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009100248] [2025-01-09 15:27:14,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:14,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:14,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 15:27:14,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 15:27:14,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:14,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:27:15,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:15,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009100248] [2025-01-09 15:27:15,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009100248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:15,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:15,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:15,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369616055] [2025-01-09 15:27:15,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:15,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:15,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:15,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:15,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:15,062 INFO L87 Difference]: Start difference. First operand 293 states and 413 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:15,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:15,286 INFO L93 Difference]: Finished difference Result 772 states and 1081 transitions. [2025-01-09 15:27:15,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:15,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 126 [2025-01-09 15:27:15,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:15,289 INFO L225 Difference]: With dead ends: 772 [2025-01-09 15:27:15,289 INFO L226 Difference]: Without dead ends: 482 [2025-01-09 15:27:15,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:27:15,290 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 190 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:15,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 641 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:27:15,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-01-09 15:27:15,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 446. [2025-01-09 15:27:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 401 states have (on average 1.3541147132169575) internal successors, (543), 403 states have internal predecessors, (543), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 15:27:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 623 transitions. [2025-01-09 15:27:15,308 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 623 transitions. Word has length 126 [2025-01-09 15:27:15,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:15,308 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 623 transitions. [2025-01-09 15:27:15,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 623 transitions. [2025-01-09 15:27:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 15:27:15,309 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:15,309 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:15,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:27:15,310 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:15,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:15,311 INFO L85 PathProgramCache]: Analyzing trace with hash -313718284, now seen corresponding path program 1 times [2025-01-09 15:27:15,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:15,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843166921] [2025-01-09 15:27:15,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:15,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:15,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 15:27:15,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 15:27:15,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:15,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:27:15,404 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:27:15,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 15:27:15,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 15:27:15,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:15,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:27:15,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:27:15,522 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:27:15,523 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:27:15,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:27:15,526 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:15,599 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:27:15,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:27:15 BoogieIcfgContainer [2025-01-09 15:27:15,603 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:27:15,603 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:27:15,603 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:27:15,603 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:27:15,604 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:27:08" (3/4) ... [2025-01-09 15:27:15,605 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:27:15,606 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:27:15,606 INFO L158 Benchmark]: Toolchain (without parser) took 8263.78ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 112.4MB in the beginning and 250.7MB in the end (delta: -138.3MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2025-01-09 15:27:15,607 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:27:15,607 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.97ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 95.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:27:15,607 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.51ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 91.1MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:27:15,608 INFO L158 Benchmark]: Boogie Preprocessor took 71.82ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 85.5MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:27:15,608 INFO L158 Benchmark]: RCFGBuilder took 654.61ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 50.1MB in the end (delta: 35.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:27:15,608 INFO L158 Benchmark]: TraceAbstraction took 7243.03ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 49.7MB in the beginning and 250.8MB in the end (delta: -201.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:27:15,608 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 335.5MB. Free memory was 250.8MB in the beginning and 250.7MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:27:15,609 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.23ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.97ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 95.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.51ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 91.1MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.82ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 85.5MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 654.61ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 50.1MB in the end (delta: 35.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7243.03ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 49.7MB in the beginning and 250.8MB in the end (delta: -201.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 335.5MB. Free memory was 250.8MB in the beginning and 250.7MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] double double_Array_0[2] = { 3.75, 255.5 }; [L25-L27] double double_Array_0[2] = { 3.75, 255.5 }; [L25-L27] double double_Array_0[2] = { 3.75, 255.5 }; [L28-L30] float float_Array_0[3] = { 255.5, 63.5, 128.75 }; [L28-L30] float float_Array_0[3] = { 255.5, 63.5, 128.75 }; [L28-L30] float float_Array_0[3] = { 255.5, 63.5, 128.75 }; [L28-L30] float float_Array_0[3] = { 255.5, 63.5, 128.75 }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L34] unsigned char last_1_unsigned_char_Array_0_0__0__0_ = 2; [L35] unsigned char last_1_unsigned_char_Array_0_0__0__1_ = 0; [L36] unsigned char last_1_unsigned_char_Array_0_1__1__1_ = 32; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L101] isInitial = 1 [L102] FCALL initially() [L104] CALL updateLastVariables() [L92] EXPR unsigned_char_Array_0[0][0][0] [L92] last_1_unsigned_char_Array_0_0__0__0_ = unsigned_char_Array_0[0][0][0] [L93] EXPR unsigned_char_Array_0[0][0][1] [L93] last_1_unsigned_char_Array_0_0__0__1_ = unsigned_char_Array_0[0][0][1] [L94] EXPR unsigned_char_Array_0[1][1][1] [L94] last_1_unsigned_char_Array_0_1__1__1_ = unsigned_char_Array_0[1][1][1] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L68] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L71] float_Array_0[0] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[0] [L72] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L72] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L72] EXPR float_Array_0[0] [L72] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L72] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L72] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L72] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L72] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L73] float_Array_0[1] = __VERIFIER_nondet_float() [L74] EXPR float_Array_0[1] [L74] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L74] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L74] EXPR float_Array_0[1] [L74] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L74] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L74] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L74] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L74] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L75] unsigned_char_Array_0[1][0][0] = __VERIFIER_nondet_uchar() [L76] EXPR unsigned_char_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L76] CALL assume_abort_if_not(unsigned_char_Array_0[1][0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L76] RET assume_abort_if_not(unsigned_char_Array_0[1][0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L77] EXPR unsigned_char_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not(unsigned_char_Array_0[1][0][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L77] RET assume_abort_if_not(unsigned_char_Array_0[1][0][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L78] unsigned_char_Array_0[0][1][0] = __VERIFIER_nondet_uchar() [L79] EXPR unsigned_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L79] CALL assume_abort_if_not(unsigned_char_Array_0[0][1][0] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L79] RET assume_abort_if_not(unsigned_char_Array_0[0][1][0] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L80] EXPR unsigned_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(unsigned_char_Array_0[0][1][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L80] RET assume_abort_if_not(unsigned_char_Array_0[0][1][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L81] unsigned_char_Array_0[1][1][0] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[1][1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[1][1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L83] EXPR unsigned_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[1][1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[1][1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L84] unsigned_char_Array_0[1][0][1] = __VERIFIER_nondet_uchar() [L85] EXPR unsigned_char_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L86] EXPR unsigned_char_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[1][0][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[1][0][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L87] unsigned_char_Array_0[0][1][1] = __VERIFIER_nondet_uchar() [L88] EXPR unsigned_char_Array_0[0][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[0][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[0][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L89] EXPR unsigned_char_Array_0[0][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[0][1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[0][1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L105] RET updateVariables() [L106] CALL step() [L40] EXPR last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_ VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L40] signed long int stepLocal_0 = last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_; [L41] COND FALSE !((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= stepLocal_0) [L44] EXPR unsigned_char_Array_0[0][1][0] [L44] EXPR unsigned_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L44] EXPR ((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]) [L44] EXPR unsigned_char_Array_0[1][1][0] [L44] EXPR ((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L44] unsigned_char_Array_0[1][1][1] = (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))) [L46] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L46] COND FALSE !(! BOOL_unsigned_char_Array_0[0]) [L51] EXPR float_Array_0[0] [L51] double_Array_0[0] = float_Array_0[0] [L52] EXPR unsigned_char_Array_0[1][0][0] [L52] unsigned_char_Array_0[0][0][1] = unsigned_char_Array_0[1][0][0] [L53] EXPR float_Array_0[1] [L53] double_Array_0[1] = float_Array_0[1] [L54] EXPR unsigned_char_Array_0[1][0][0] [L54] unsigned char stepLocal_1 = unsigned_char_Array_0[1][0][0]; [L55] EXPR unsigned_char_Array_0[1][1][1] [L55] EXPR unsigned_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L55] COND FALSE !((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= stepLocal_1) [L64] EXPR unsigned_char_Array_0[1][0][0] [L64] unsigned_char_Array_0[0][0][0] = unsigned_char_Array_0[1][0][0] [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1 [L97] EXPR (! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_ VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))) [L97] EXPR unsigned_char_Array_0[1][1][1] [L97] EXPR unsigned_char_Array_0[0][1][0] [L97] EXPR unsigned_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]) [L97] EXPR unsigned_char_Array_0[1][1][0] [L97] EXPR ((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) [L97] EXPR unsigned_char_Array_0[1][1][1] [L97] EXPR unsigned_char_Array_0[1][1][0] [L97] EXPR unsigned_char_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])) [L97] EXPR unsigned_char_Array_0[0][0][0] [L97] EXPR unsigned_char_Array_0[1][0][0] [L97] EXPR ((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0])) [L97] EXPR double_Array_0[0] [L97] EXPR float_Array_0[0] [L97] EXPR ((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) && (double_Array_0[1] == ((double) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) && (double_Array_0[1] == ((double) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97-L98] return ((((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) && (double_Array_0[1] == ((double) float_Array_0[1])) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 12, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 577 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 573 mSDsluCounter, 7015 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5252 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1034 IncrementalHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 1763 mSDtfsCounter, 1034 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 697 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=11, InterpolantAutomatonStates: 59, 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, 11 MinimizatonAttempts, 209 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2092 NumberOfCodeBlocks, 2092 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1948 ConstructedInterpolants, 0 QuantifiedInterpolants, 2747 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2112 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 5642/5824 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 15:27:15,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67160a6df79d1049c73d7b3dbc4aa323b185d65b8c91424febe1ccb6e4daf12a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:27:17,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:27:17,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:27:17,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:27:17,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:27:17,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:27:17,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:27:17,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:27:17,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:27:17,693 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:27:17,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:27:17,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:27:17,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:27:17,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:27:17,693 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:27:17,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:27:17,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:27:17,693 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:27:17,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:27:17,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:27:17,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:27:17,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:27:17,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:27:17,694 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:27:17,694 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:27:17,694 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:27:17,694 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:27:17,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:27:17,694 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:27:17,694 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:27:17,694 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:27:17,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:27:17,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:27:17,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:27:17,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:27:17,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:27:17,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:27:17,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:27:17,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:27:17,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:27:17,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:27:17,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:27:17,695 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:27:17,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:27:17,695 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:27:17,695 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:27:17,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:27:17,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:27:17,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:27:17,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:27:17,695 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 -> 67160a6df79d1049c73d7b3dbc4aa323b185d65b8c91424febe1ccb6e4daf12a [2025-01-09 15:27:17,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:27:17,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:27:17,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:27:17,975 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:27:17,976 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:27:17,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i [2025-01-09 15:27:19,208 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6319904a9/ce2c6195f28c4cfa92978ad6c9a97be0/FLAG085c314c8 [2025-01-09 15:27:19,411 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:27:19,412 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i [2025-01-09 15:27:19,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6319904a9/ce2c6195f28c4cfa92978ad6c9a97be0/FLAG085c314c8 [2025-01-09 15:27:19,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6319904a9/ce2c6195f28c4cfa92978ad6c9a97be0 [2025-01-09 15:27:19,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:27:19,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:27:19,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:27:19,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:27:19,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:27:19,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:27:19" (1/1) ... [2025-01-09 15:27:19,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58454b85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:19, skipping insertion in model container [2025-01-09 15:27:19,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:27:19" (1/1) ... [2025-01-09 15:27:19,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:27:19,578 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i[916,929] [2025-01-09 15:27:19,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:27:19,661 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:27:19,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i[916,929] [2025-01-09 15:27:19,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:27:19,722 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:27:19,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:19 WrapperNode [2025-01-09 15:27:19,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:27:19,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:27:19,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:27:19,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:27:19,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:19" (1/1) ... [2025-01-09 15:27:19,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:19" (1/1) ... [2025-01-09 15:27:19,786 INFO L138 Inliner]: procedures = 33, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 494 [2025-01-09 15:27:19,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:27:19,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:27:19,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:27:19,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:27:19,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:19" (1/1) ... [2025-01-09 15:27:19,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:19" (1/1) ... [2025-01-09 15:27:19,800 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:19" (1/1) ... [2025-01-09 15:27:19,814 INFO L175 MemorySlicer]: Split 133 memory accesses to 5 slices as follows [2, 10, 6, 41, 74]. 56 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 2, 3, 8]. The 17 writes are split as follows [0, 1, 2, 3, 11]. [2025-01-09 15:27:19,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:19" (1/1) ... [2025-01-09 15:27:19,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:19" (1/1) ... [2025-01-09 15:27:19,828 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:19" (1/1) ... [2025-01-09 15:27:19,830 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:19" (1/1) ... [2025-01-09 15:27:19,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:19" (1/1) ... [2025-01-09 15:27:19,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:19" (1/1) ... [2025-01-09 15:27:19,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:19" (1/1) ... [2025-01-09 15:27:19,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:27:19,852 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:27:19,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:27:19,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:27:19,854 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:19" (1/1) ... [2025-01-09 15:27:19,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:27:19,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:19,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:27:19,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:27:19,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:27:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:27:19,903 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:27:19,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:27:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:27:19,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:27:19,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:27:19,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:27:20,038 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:27:20,041 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:27:22,166 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-01-09 15:27:22,166 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:27:22,177 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:27:22,177 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:27:22,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:27:22 BoogieIcfgContainer [2025-01-09 15:27:22,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:27:22,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:27:22,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:27:22,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:27:22,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:27:19" (1/3) ... [2025-01-09 15:27:22,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d08d568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:27:22, skipping insertion in model container [2025-01-09 15:27:22,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:19" (2/3) ... [2025-01-09 15:27:22,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d08d568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:27:22, skipping insertion in model container [2025-01-09 15:27:22,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:27:22" (3/3) ... [2025-01-09 15:27:22,185 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-82.i [2025-01-09 15:27:22,196 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:27:22,197 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-82.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:27:22,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:27:22,247 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;@74b8c77f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:27:22,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:27:22,254 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:27:22,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:27:22,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:22,269 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:22,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:22,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:22,277 INFO L85 PathProgramCache]: Analyzing trace with hash -711976463, now seen corresponding path program 1 times [2025-01-09 15:27:22,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:22,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777439611] [2025-01-09 15:27:22,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:22,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:22,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:22,297 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:27:22,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 15:27:22,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:27:22,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:27:22,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:22,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:22,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:27:22,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-01-09 15:27:22,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:22,601 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:22,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777439611] [2025-01-09 15:27:22,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777439611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:22,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:22,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:27:22,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67976513] [2025-01-09 15:27:22,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:22,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:27:22,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:22,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:27:22,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:27:22,624 INFO L87 Difference]: Start difference. First operand has 107 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:27:22,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:22,649 INFO L93 Difference]: Finished difference Result 208 states and 319 transitions. [2025-01-09 15:27:22,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:27:22,651 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2025-01-09 15:27:22,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:22,655 INFO L225 Difference]: With dead ends: 208 [2025-01-09 15:27:22,656 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 15:27:22,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:27:22,663 INFO L435 NwaCegarLoop]: 146 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, 146 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:22,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:22,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 15:27:22,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-01-09 15:27:22,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:27:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2025-01-09 15:27:22,733 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 119 [2025-01-09 15:27:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:22,734 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2025-01-09 15:27:22,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:27:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2025-01-09 15:27:22,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:27:22,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:22,736 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:22,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 15:27:22,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:22,941 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:22,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:22,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1079894487, now seen corresponding path program 1 times [2025-01-09 15:27:22,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:22,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432693986] [2025-01-09 15:27:22,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:22,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:22,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:22,946 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:27:22,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 15:27:23,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:27:23,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:27:23,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:23,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:23,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:27:23,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-01-09 15:27:23,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:23,227 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:23,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432693986] [2025-01-09 15:27:23,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432693986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:23,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:23,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:27:23,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74755224] [2025-01-09 15:27:23,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:23,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:27:23,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:23,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:27:23,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:23,229 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:27:23,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:23,298 INFO L93 Difference]: Finished difference Result 207 states and 292 transitions. [2025-01-09 15:27:23,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:27:23,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2025-01-09 15:27:23,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:23,300 INFO L225 Difference]: With dead ends: 207 [2025-01-09 15:27:23,302 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 15:27:23,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:23,303 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:23,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:23,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 15:27:23,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-01-09 15:27:23,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:27:23,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2025-01-09 15:27:23,319 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 119 [2025-01-09 15:27:23,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:23,320 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2025-01-09 15:27:23,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:27:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2025-01-09 15:27:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:27:23,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:23,322 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:23,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 15:27:23,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:23,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:23,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1963403477, now seen corresponding path program 1 times [2025-01-09 15:27:23,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:23,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527414776] [2025-01-09 15:27:23,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:23,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:23,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:23,530 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:27:23,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 15:27:23,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:27:23,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:27:23,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:23,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:23,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:27:23,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:23,768 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:27:23,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:23,768 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:23,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527414776] [2025-01-09 15:27:23,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527414776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:23,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:23,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:27:23,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558702949] [2025-01-09 15:27:23,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:23,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:27:23,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:23,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:27:23,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:23,770 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:23,829 INFO L93 Difference]: Finished difference Result 211 states and 296 transitions. [2025-01-09 15:27:23,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:27:23,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-01-09 15:27:23,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:23,834 INFO L225 Difference]: With dead ends: 211 [2025-01-09 15:27:23,834 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 15:27:23,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:23,835 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:23,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:23,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 15:27:23,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-01-09 15:27:23,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:27:23,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 150 transitions. [2025-01-09 15:27:23,855 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 150 transitions. Word has length 119 [2025-01-09 15:27:23,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:23,856 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 150 transitions. [2025-01-09 15:27:23,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:23,856 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 150 transitions. [2025-01-09 15:27:23,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:27:23,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:23,857 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:23,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 15:27:24,057 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 15:27:24,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:24,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:24,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1608831559, now seen corresponding path program 1 times [2025-01-09 15:27:24,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:24,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183353516] [2025-01-09 15:27:24,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:24,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:24,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:24,061 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 15:27:24,063 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 15:27:24,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:27:24,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:27:24,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:24,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:24,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:27:24,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:24,737 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 27 treesize of output 15 [2025-01-09 15:27:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-01-09 15:27:24,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:27:24,939 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:27:24,939 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:24,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183353516] [2025-01-09 15:27:24,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183353516] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:24,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:27:24,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-01-09 15:27:24,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984317830] [2025-01-09 15:27:24,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:24,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:27:24,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:24,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:27:24,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:27:24,940 INFO L87 Difference]: Start difference. First operand 108 states and 150 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:25,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:25,022 INFO L93 Difference]: Finished difference Result 257 states and 357 transitions. [2025-01-09 15:27:25,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:27:25,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-01-09 15:27:25,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:25,024 INFO L225 Difference]: With dead ends: 257 [2025-01-09 15:27:25,027 INFO L226 Difference]: Without dead ends: 152 [2025-01-09 15:27:25,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:27:25,029 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 58 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:25,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 606 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:27:25,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-09 15:27:25,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 118. [2025-01-09 15:27:25,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 102 states have internal predecessors, (137), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:27:25,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 165 transitions. [2025-01-09 15:27:25,037 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 165 transitions. Word has length 121 [2025-01-09 15:27:25,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:25,037 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 165 transitions. [2025-01-09 15:27:25,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:25,037 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 165 transitions. [2025-01-09 15:27:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 15:27:25,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:25,040 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:25,047 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 15:27:25,240 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 15:27:25,241 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:25,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:25,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1370832940, now seen corresponding path program 1 times [2025-01-09 15:27:25,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:25,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372567609] [2025-01-09 15:27:25,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:25,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:25,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:25,243 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:27:25,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 15:27:25,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 15:27:25,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 15:27:25,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:25,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:25,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:27:25,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:27:25,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:25,451 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:25,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372567609] [2025-01-09 15:27:25,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372567609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:25,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:25,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:27:25,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248280440] [2025-01-09 15:27:25,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:25,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:27:25,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:25,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:27:25,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:27:25,453 INFO L87 Difference]: Start difference. First operand 118 states and 165 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:25,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:25,502 INFO L93 Difference]: Finished difference Result 236 states and 331 transitions. [2025-01-09 15:27:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:27:25,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-01-09 15:27:25,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:25,504 INFO L225 Difference]: With dead ends: 236 [2025-01-09 15:27:25,504 INFO L226 Difference]: Without dead ends: 121 [2025-01-09 15:27:25,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:27:25,505 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:25,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 557 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-09 15:27:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2025-01-09 15:27:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:27:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 166 transitions. [2025-01-09 15:27:25,513 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 166 transitions. Word has length 122 [2025-01-09 15:27:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:25,514 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 166 transitions. [2025-01-09 15:27:25,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:25,514 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 166 transitions. [2025-01-09 15:27:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:27:25,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:25,514 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:25,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 15:27:25,720 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 15:27:25,720 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:25,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:25,720 INFO L85 PathProgramCache]: Analyzing trace with hash 954511909, now seen corresponding path program 1 times [2025-01-09 15:27:25,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:25,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589810477] [2025-01-09 15:27:25,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:25,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:25,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:25,723 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 15:27:25,724 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 15:27:25,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:27:25,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:27:25,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:25,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:25,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:27:25,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:25,950 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:27:25,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:25,950 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:25,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589810477] [2025-01-09 15:27:25,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589810477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:25,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:25,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:27:25,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005580820] [2025-01-09 15:27:25,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:25,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:27:25,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:25,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:27:25,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:27:25,951 INFO L87 Difference]: Start difference. First operand 119 states and 166 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:26,125 INFO L93 Difference]: Finished difference Result 240 states and 336 transitions. [2025-01-09 15:27:26,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:27:26,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-01-09 15:27:26,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:26,127 INFO L225 Difference]: With dead ends: 240 [2025-01-09 15:27:26,127 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 15:27:26,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:27:26,127 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:26,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 549 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:27:26,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 15:27:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2025-01-09 15:27:26,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.3271028037383177) internal successors, (142), 107 states have internal predecessors, (142), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:27:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 170 transitions. [2025-01-09 15:27:26,132 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 170 transitions. Word has length 123 [2025-01-09 15:27:26,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:26,132 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 170 transitions. [2025-01-09 15:27:26,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:26,132 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 170 transitions. [2025-01-09 15:27:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:27:26,133 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:26,133 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:26,140 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 15:27:26,334 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 15:27:26,334 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:26,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:26,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1565448025, now seen corresponding path program 1 times [2025-01-09 15:27:26,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:26,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274899032] [2025-01-09 15:27:26,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:26,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:26,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:26,338 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:27:26,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 15:27:26,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:27:26,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:27:26,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:26,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:26,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:27:26,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:27:26,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:26,546 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:26,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274899032] [2025-01-09 15:27:26,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274899032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:26,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:26,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:26,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623919789] [2025-01-09 15:27:26,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:26,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:26,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:26,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:26,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:26,548 INFO L87 Difference]: Start difference. First operand 123 states and 170 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:26,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:26,695 INFO L93 Difference]: Finished difference Result 246 states and 341 transitions. [2025-01-09 15:27:26,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:26,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-01-09 15:27:26,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:26,698 INFO L225 Difference]: With dead ends: 246 [2025-01-09 15:27:26,698 INFO L226 Difference]: Without dead ends: 126 [2025-01-09 15:27:26,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:26,699 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:26,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 680 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:27:26,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-09 15:27:26,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2025-01-09 15:27:26,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 109 states have (on average 1.3211009174311927) internal successors, (144), 109 states have internal predecessors, (144), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:27:26,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 172 transitions. [2025-01-09 15:27:26,707 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 172 transitions. Word has length 123 [2025-01-09 15:27:26,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:26,712 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 172 transitions. [2025-01-09 15:27:26,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 172 transitions. [2025-01-09 15:27:26,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:27:26,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:26,713 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:26,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2025-01-09 15:27:26,913 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 15:27:26,914 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:26,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:26,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1563600983, now seen corresponding path program 1 times [2025-01-09 15:27:26,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:26,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651117940] [2025-01-09 15:27:26,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:26,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:26,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:26,916 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 15:27:26,917 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 15:27:27,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:27:27,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:27:27,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:27,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:27,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 15:27:27,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:27,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:27:27,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 15:27:27,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-01-09 15:27:27,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-01-09 15:27:27,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:27,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 41 [2025-01-09 15:27:27,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:27,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 45 [2025-01-09 15:27:27,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:27,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 45 [2025-01-09 15:27:27,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:27,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 31 [2025-01-09 15:27:27,884 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-09 15:27:27,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:27,885 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:27,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651117940] [2025-01-09 15:27:27,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651117940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:27,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:27,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:27:27,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159365945] [2025-01-09 15:27:27,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:27,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:27:27,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:27,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:27:27,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:27:27,886 INFO L87 Difference]: Start difference. First operand 125 states and 172 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:27:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:29,672 INFO L93 Difference]: Finished difference Result 350 states and 483 transitions. [2025-01-09 15:27:29,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:27:29,672 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2025-01-09 15:27:29,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:29,674 INFO L225 Difference]: With dead ends: 350 [2025-01-09 15:27:29,674 INFO L226 Difference]: Without dead ends: 228 [2025-01-09 15:27:29,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:27:29,675 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 279 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:29,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 977 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 15:27:29,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-01-09 15:27:29,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2025-01-09 15:27:29,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 202 states have (on average 1.3415841584158417) internal successors, (271), 203 states have internal predecessors, (271), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:27:29,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 311 transitions. [2025-01-09 15:27:29,697 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 311 transitions. Word has length 123 [2025-01-09 15:27:29,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:29,697 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 311 transitions. [2025-01-09 15:27:29,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:27:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 311 transitions. [2025-01-09 15:27:29,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:27:29,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:29,698 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:29,708 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 15:27:29,899 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 15:27:29,899 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:29,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:29,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1691764750, now seen corresponding path program 1 times [2025-01-09 15:27:29,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:29,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422135145] [2025-01-09 15:27:29,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:29,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:29,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:29,902 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:27:29,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-01-09 15:27:29,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:27:30,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:27:30,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:30,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:30,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:27:30,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:30,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-01-09 15:27:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:27:30,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:30,277 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:30,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422135145] [2025-01-09 15:27:30,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422135145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:30,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:30,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:27:30,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560996261] [2025-01-09 15:27:30,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:30,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:27:30,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:30,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:27:30,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:30,279 INFO L87 Difference]: Start difference. First operand 225 states and 311 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:30,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:30,871 INFO L93 Difference]: Finished difference Result 637 states and 884 transitions. [2025-01-09 15:27:30,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:27:30,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-01-09 15:27:30,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:30,876 INFO L225 Difference]: With dead ends: 637 [2025-01-09 15:27:30,876 INFO L226 Difference]: Without dead ends: 415 [2025-01-09 15:27:30,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:27:30,877 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 112 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:30,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 374 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:27:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-01-09 15:27:30,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 347. [2025-01-09 15:27:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 309 states have (on average 1.3559870550161812) internal successors, (419), 310 states have internal predecessors, (419), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:27:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 487 transitions. [2025-01-09 15:27:30,897 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 487 transitions. Word has length 123 [2025-01-09 15:27:30,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:30,898 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 487 transitions. [2025-01-09 15:27:30,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 487 transitions. [2025-01-09 15:27:30,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:27:30,899 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:30,899 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:30,906 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 15:27:31,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:31,100 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:31,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:31,101 INFO L85 PathProgramCache]: Analyzing trace with hash -392355904, now seen corresponding path program 1 times [2025-01-09 15:27:31,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:31,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062252501] [2025-01-09 15:27:31,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:31,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:31,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:31,105 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:27:31,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-01-09 15:27:31,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:27:31,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:27:31,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:31,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:31,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:27:31,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:31,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-01-09 15:27:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:27:31,499 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:31,499 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:31,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062252501] [2025-01-09 15:27:31,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062252501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:31,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:31,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:27:31,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734893266] [2025-01-09 15:27:31,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:31,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:27:31,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:31,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:27:31,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:27:31,500 INFO L87 Difference]: Start difference. First operand 347 states and 487 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:32,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:32,058 INFO L93 Difference]: Finished difference Result 605 states and 840 transitions. [2025-01-09 15:27:32,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:27:32,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-01-09 15:27:32,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:32,061 INFO L225 Difference]: With dead ends: 605 [2025-01-09 15:27:32,061 INFO L226 Difference]: Without dead ends: 346 [2025-01-09 15:27:32,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:32,062 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 118 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:32,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 475 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:27:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-01-09 15:27:32,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 310. [2025-01-09 15:27:32,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 272 states have (on average 1.338235294117647) internal successors, (364), 273 states have internal predecessors, (364), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:27:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 432 transitions. [2025-01-09 15:27:32,078 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 432 transitions. Word has length 123 [2025-01-09 15:27:32,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:32,080 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 432 transitions. [2025-01-09 15:27:32,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 432 transitions. [2025-01-09 15:27:32,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 15:27:32,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:32,081 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:32,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-01-09 15:27:32,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:32,282 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:32,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:32,283 INFO L85 PathProgramCache]: Analyzing trace with hash 207443605, now seen corresponding path program 1 times [2025-01-09 15:27:32,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:32,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152268270] [2025-01-09 15:27:32,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:32,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:32,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:32,285 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:27:32,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-01-09 15:27:32,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:27:32,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:27:32,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:32,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:32,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:27:32,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-01-09 15:27:32,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:27:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:27:32,818 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:32,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152268270] [2025-01-09 15:27:32,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152268270] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:32,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:27:32,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-01-09 15:27:32,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843269699] [2025-01-09 15:27:32,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:32,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:27:32,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:32,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:27:32,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:27:32,819 INFO L87 Difference]: Start difference. First operand 310 states and 432 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:32,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:32,901 INFO L93 Difference]: Finished difference Result 607 states and 832 transitions. [2025-01-09 15:27:32,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:27:32,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 124 [2025-01-09 15:27:32,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:32,910 INFO L225 Difference]: With dead ends: 607 [2025-01-09 15:27:32,910 INFO L226 Difference]: Without dead ends: 379 [2025-01-09 15:27:32,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:27:32,911 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 62 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:32,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 626 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:27:32,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-01-09 15:27:32,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 295. [2025-01-09 15:27:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 257 states have (on average 1.3229571984435797) internal successors, (340), 258 states have internal predecessors, (340), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:27:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 408 transitions. [2025-01-09 15:27:32,925 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 408 transitions. Word has length 124 [2025-01-09 15:27:32,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:32,927 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 408 transitions. [2025-01-09 15:27:32,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:27:32,927 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 408 transitions. [2025-01-09 15:27:32,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:27:32,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:32,928 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:32,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2025-01-09 15:27:33,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:33,129 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:33,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:33,129 INFO L85 PathProgramCache]: Analyzing trace with hash 808484294, now seen corresponding path program 1 times [2025-01-09 15:27:33,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:33,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302043049] [2025-01-09 15:27:33,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:33,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:33,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:33,133 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:27:33,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-01-09 15:27:33,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:27:33,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:27:33,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:33,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:33,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 15:27:33,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:33,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 15:27:33,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 15:27:33,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-01-09 15:27:33,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:33,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-01-09 15:27:33,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:33,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2025-01-09 15:27:33,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:33,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2025-01-09 15:27:33,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:33,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2025-01-09 15:27:34,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:34,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58 [2025-01-09 15:27:34,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:34,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 42 [2025-01-09 15:27:34,241 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-01-09 15:27:34,241 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:34,241 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:34,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [302043049] [2025-01-09 15:27:34,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [302043049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:34,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:34,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:27:34,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602204715] [2025-01-09 15:27:34,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:34,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:27:34,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:34,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:27:34,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:27:34,242 INFO L87 Difference]: Start difference. First operand 295 states and 408 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:27:35,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:35,291 INFO L93 Difference]: Finished difference Result 663 states and 900 transitions. [2025-01-09 15:27:35,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:27:35,292 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 125 [2025-01-09 15:27:35,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:35,293 INFO L225 Difference]: With dead ends: 663 [2025-01-09 15:27:35,294 INFO L226 Difference]: Without dead ends: 451 [2025-01-09 15:27:35,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:27:35,294 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 223 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:35,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 602 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 15:27:35,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-01-09 15:27:35,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 447. [2025-01-09 15:27:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 399 states have (on average 1.300751879699248) internal successors, (519), 402 states have internal predecessors, (519), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 15:27:35,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 603 transitions. [2025-01-09 15:27:35,324 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 603 transitions. Word has length 125 [2025-01-09 15:27:35,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:35,325 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 603 transitions. [2025-01-09 15:27:35,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-01-09 15:27:35,325 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 603 transitions. [2025-01-09 15:27:35,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:27:35,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:35,326 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:35,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-01-09 15:27:35,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:35,526 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:35,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:35,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1648428480, now seen corresponding path program 1 times [2025-01-09 15:27:35,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:35,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405428728] [2025-01-09 15:27:35,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:35,527 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:35,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:35,529 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:27:35,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-01-09 15:27:35,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:27:35,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:27:35,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:35,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:35,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 15:27:35,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:37,131 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 20 treesize of output 21 [2025-01-09 15:27:41,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:41,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 98 [2025-01-09 15:27:41,072 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 197 treesize of output 107 [2025-01-09 15:27:41,386 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-01-09 15:27:41,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:41,386 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:41,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405428728] [2025-01-09 15:27:41,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405428728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:41,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:41,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:27:41,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874178633] [2025-01-09 15:27:41,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:41,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:27:41,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:41,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:27:41,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:27:41,387 INFO L87 Difference]: Start difference. First operand 447 states and 603 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:27:44,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:27:51,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:27:52,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:27:53,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:53,740 INFO L93 Difference]: Finished difference Result 873 states and 1163 transitions. [2025-01-09 15:27:53,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:27:53,744 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2025-01-09 15:27:53,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:53,749 INFO L225 Difference]: With dead ends: 873 [2025-01-09 15:27:53,749 INFO L226 Difference]: Without dead ends: 871 [2025-01-09 15:27:53,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:27:53,750 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 246 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:53,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 971 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2025-01-09 15:27:53,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2025-01-09 15:27:53,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 865. [2025-01-09 15:27:53,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 769 states have (on average 1.2886866059817945) internal successors, (991), 779 states have internal predecessors, (991), 81 states have call successors, (81), 14 states have call predecessors, (81), 14 states have return successors, (81), 71 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 15:27:53,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1153 transitions. [2025-01-09 15:27:53,800 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1153 transitions. Word has length 125 [2025-01-09 15:27:53,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:53,801 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1153 transitions. [2025-01-09 15:27:53,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:27:53,801 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1153 transitions. [2025-01-09 15:27:53,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:27:53,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:53,802 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:53,811 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 (14)] Forceful destruction successful, exit code 0 [2025-01-09 15:27:54,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:54,003 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:54,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:54,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1646581438, now seen corresponding path program 1 times [2025-01-09 15:27:54,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:54,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731610002] [2025-01-09 15:27:54,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:54,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:54,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:54,006 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:27:54,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-01-09 15:27:54,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:27:54,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:27:54,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:54,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:54,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 15:27:54,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:54,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 15:27:54,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 15:27:54,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-01-09 15:27:54,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:54,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-01-09 15:27:54,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:54,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-01-09 15:27:54,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:54,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-01-09 15:27:54,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:54,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 47 [2025-01-09 15:27:54,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:54,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 59 [2025-01-09 15:27:55,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:55,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 98 treesize of output 40 [2025-01-09 15:27:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-09 15:27:55,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:55,329 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:55,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731610002] [2025-01-09 15:27:55,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731610002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:55,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:55,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:27:55,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528605597] [2025-01-09 15:27:55,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:55,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:27:55,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:55,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:27:55,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:27:55,330 INFO L87 Difference]: Start difference. First operand 865 states and 1153 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:27:56,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:56,896 INFO L93 Difference]: Finished difference Result 1591 states and 2103 transitions. [2025-01-09 15:27:56,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:27:56,900 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 125 [2025-01-09 15:27:56,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:56,903 INFO L225 Difference]: With dead ends: 1591 [2025-01-09 15:27:56,904 INFO L226 Difference]: Without dead ends: 887 [2025-01-09 15:27:56,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:27:56,905 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 261 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:56,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 672 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 15:27:56,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-01-09 15:27:56,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 683. [2025-01-09 15:27:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 605 states have (on average 1.2776859504132232) internal successors, (773), 609 states have internal predecessors, (773), 65 states have call successors, (65), 12 states have call predecessors, (65), 12 states have return successors, (65), 61 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 15:27:56,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 903 transitions. [2025-01-09 15:27:56,953 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 903 transitions. Word has length 125 [2025-01-09 15:27:56,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:56,954 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 903 transitions. [2025-01-09 15:27:56,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 15:27:56,955 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 903 transitions. [2025-01-09 15:27:56,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:27:56,955 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:56,955 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:56,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-01-09 15:27:57,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:57,156 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:57,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:57,157 INFO L85 PathProgramCache]: Analyzing trace with hash 128425924, now seen corresponding path program 1 times [2025-01-09 15:27:57,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:57,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103873101] [2025-01-09 15:27:57,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:57,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:57,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:57,159 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:27:57,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-01-09 15:27:57,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:27:57,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:27:57,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:57,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:57,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 15:27:57,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:57,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:27:57,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2025-01-09 15:27:58,956 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 30 treesize of output 39 [2025-01-09 15:28:02,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:02,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 94 [2025-01-09 15:28:02,792 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 167 treesize of output 107 [2025-01-09 15:28:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-01-09 15:28:03,062 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:28:03,062 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:03,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103873101] [2025-01-09 15:28:03,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103873101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:03,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:03,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:28:03,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62396499] [2025-01-09 15:28:03,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:03,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:28:03,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:03,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:28:03,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:28:03,064 INFO L87 Difference]: Start difference. First operand 683 states and 903 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:28:07,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:28:13,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:28:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:13,605 INFO L93 Difference]: Finished difference Result 1880 states and 2465 transitions. [2025-01-09 15:28:13,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:28:13,611 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2025-01-09 15:28:13,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:13,618 INFO L225 Difference]: With dead ends: 1880 [2025-01-09 15:28:13,618 INFO L226 Difference]: Without dead ends: 1358 [2025-01-09 15:28:13,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:28:13,621 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 197 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:13,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 810 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2025-01-09 15:28:13,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2025-01-09 15:28:13,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1352. [2025-01-09 15:28:13,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1195 states have (on average 1.2694560669456068) internal successors, (1517), 1207 states have internal predecessors, (1517), 128 states have call successors, (128), 28 states have call predecessors, (128), 28 states have return successors, (128), 116 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 15:28:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1773 transitions. [2025-01-09 15:28:13,706 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1773 transitions. Word has length 125 [2025-01-09 15:28:13,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:13,707 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 1773 transitions. [2025-01-09 15:28:13,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:28:13,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1773 transitions. [2025-01-09 15:28:13,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:28:13,709 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:13,709 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:28:13,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2025-01-09 15:28:13,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:28:13,910 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:13,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:13,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1844739454, now seen corresponding path program 1 times [2025-01-09 15:28:13,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:13,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647498750] [2025-01-09 15:28:13,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:13,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:28:13,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:13,912 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:28:13,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-01-09 15:28:13,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:28:14,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:28:14,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:14,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:14,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:28:14,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-01-09 15:28:14,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:28:14,097 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:14,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647498750] [2025-01-09 15:28:14,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647498750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:14,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:14,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:28:14,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703233560] [2025-01-09 15:28:14,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:14,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:28:14,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:14,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:28:14,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:28:14,098 INFO L87 Difference]: Start difference. First operand 1352 states and 1773 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:28:14,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:14,198 INFO L93 Difference]: Finished difference Result 2541 states and 3323 transitions. [2025-01-09 15:28:14,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:28:14,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2025-01-09 15:28:14,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:14,204 INFO L225 Difference]: With dead ends: 2541 [2025-01-09 15:28:14,204 INFO L226 Difference]: Without dead ends: 1352 [2025-01-09 15:28:14,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:28:14,211 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:14,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 409 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:28:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-01-09 15:28:14,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1352. [2025-01-09 15:28:14,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1195 states have (on average 1.2652719665271968) internal successors, (1512), 1207 states have internal predecessors, (1512), 128 states have call successors, (128), 28 states have call predecessors, (128), 28 states have return successors, (128), 116 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 15:28:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1768 transitions. [2025-01-09 15:28:14,324 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1768 transitions. Word has length 125 [2025-01-09 15:28:14,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:14,324 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 1768 transitions. [2025-01-09 15:28:14,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:28:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1768 transitions. [2025-01-09 15:28:14,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:28:14,327 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:14,327 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:28:14,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2025-01-09 15:28:14,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:28:14,527 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:14,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:14,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1623511336, now seen corresponding path program 1 times [2025-01-09 15:28:14,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:14,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99019146] [2025-01-09 15:28:14,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:14,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:28:14,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:14,531 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:28:14,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-01-09 15:28:14,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:28:14,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:28:14,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:14,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:14,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:28:14,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:14,949 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 97 treesize of output 43 [2025-01-09 15:28:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 12 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-01-09 15:28:15,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:15,249 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 61 treesize of output 25 [2025-01-09 15:28:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 15:28:15,268 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:15,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99019146] [2025-01-09 15:28:15,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99019146] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:28:15,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:28:15,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2025-01-09 15:28:15,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225035118] [2025-01-09 15:28:15,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:28:15,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:28:15,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:15,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:28:15,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:28:15,269 INFO L87 Difference]: Start difference. First operand 1352 states and 1768 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-01-09 15:28:17,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:28:19,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:19,617 INFO L93 Difference]: Finished difference Result 2624 states and 3403 transitions. [2025-01-09 15:28:19,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:28:19,622 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) Word has length 127 [2025-01-09 15:28:19,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:19,626 INFO L225 Difference]: With dead ends: 2624 [2025-01-09 15:28:19,626 INFO L226 Difference]: Without dead ends: 1380 [2025-01-09 15:28:19,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:28:19,629 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 126 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:19,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 685 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 15:28:19,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2025-01-09 15:28:19,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1340. [2025-01-09 15:28:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1183 states have (on average 1.25781910397295) internal successors, (1488), 1195 states have internal predecessors, (1488), 128 states have call successors, (128), 28 states have call predecessors, (128), 28 states have return successors, (128), 116 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 15:28:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1744 transitions. [2025-01-09 15:28:19,715 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1744 transitions. Word has length 127 [2025-01-09 15:28:19,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:19,715 INFO L471 AbstractCegarLoop]: Abstraction has 1340 states and 1744 transitions. [2025-01-09 15:28:19,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-01-09 15:28:19,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1744 transitions. [2025-01-09 15:28:19,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:28:19,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:19,717 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:28:19,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2025-01-09 15:28:19,917 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 15:28:19,918 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:19,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:19,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1364313562, now seen corresponding path program 1 times [2025-01-09 15:28:19,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:19,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064007398] [2025-01-09 15:28:19,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:19,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:28:19,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:19,920 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 15:28:19,921 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 15:28:20,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:28:20,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:28:20,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:20,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:20,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 15:28:20,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:21,884 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 20 treesize of output 21 [2025-01-09 15:28:26,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:26,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 98 [2025-01-09 15:28:26,132 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 195 treesize of output 105 [2025-01-09 15:28:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 142 proven. 30 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-01-09 15:28:26,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:32,157 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:32,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064007398] [2025-01-09 15:28:32,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064007398] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:32,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2077375595] [2025-01-09 15:28:32,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:32,158 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:28:32,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:28:32,160 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:28:32,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2025-01-09 15:28:32,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:28:32,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:28:32,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:32,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:32,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 15:28:32,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:36,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17