./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-97.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 b62f33a7ccb058dd1bccedc0e4fe3fa92f34517f00ef57b41d6990849c30929b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:30:02,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:30:02,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:30:02,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:30:02,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:30:02,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:30:02,311 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:30:02,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:30:02,312 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:30:02,312 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:30:02,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:30:02,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:30:02,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:30:02,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:30:02,314 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:30:02,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:30:02,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:30:02,314 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:30:02,314 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:30:02,314 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:30:02,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:30:02,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:30:02,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:30:02,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:30:02,315 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:30:02,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:30:02,315 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:30:02,315 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:30:02,315 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:30:02,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:30:02,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:30:02,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:30:02,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:30:02,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:30:02,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:30:02,315 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:30:02,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:30:02,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:30:02,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:30:02,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:30:02,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:30:02,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:30:02,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:30:02,315 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/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 -> b62f33a7ccb058dd1bccedc0e4fe3fa92f34517f00ef57b41d6990849c30929b [2025-03-17 05:30:02,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:30:02,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:30:02,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:30:02,571 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:30:02,571 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:30:02,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-97.i [2025-03-17 05:30:03,673 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b1164551/9b6416249e20482abcb9c639221266c7/FLAG85e76af2e [2025-03-17 05:30:03,880 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:30:03,880 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-97.i [2025-03-17 05:30:03,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b1164551/9b6416249e20482abcb9c639221266c7/FLAG85e76af2e [2025-03-17 05:30:04,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b1164551/9b6416249e20482abcb9c639221266c7 [2025-03-17 05:30:04,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:30:04,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:30:04,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:30:04,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:30:04,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:30:04,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:30:04" (1/1) ... [2025-03-17 05:30:04,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1daea35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:04, skipping insertion in model container [2025-03-17 05:30:04,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:30:04" (1/1) ... [2025-03-17 05:30:04,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:30:04,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-97.i[916,929] [2025-03-17 05:30:04,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:30:04,417 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:30:04,425 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-97.i[916,929] [2025-03-17 05:30:04,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:30:04,464 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:30:04,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:04 WrapperNode [2025-03-17 05:30:04,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:30:04,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:30:04,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:30:04,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:30:04,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:04" (1/1) ... [2025-03-17 05:30:04,477 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:04" (1/1) ... [2025-03-17 05:30:04,505 INFO L138 Inliner]: procedures = 29, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 435 [2025-03-17 05:30:04,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:30:04,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:30:04,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:30:04,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:30:04,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:04" (1/1) ... [2025-03-17 05:30:04,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:04" (1/1) ... [2025-03-17 05:30:04,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:04" (1/1) ... [2025-03-17 05:30:04,532 INFO L175 MemorySlicer]: Split 116 memory accesses to 6 slices as follows [2, 25, 17, 25, 34, 13]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 3, 2, 3, 5, 2]. The 19 writes are split as follows [0, 4, 2, 4, 7, 2]. [2025-03-17 05:30:04,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:04" (1/1) ... [2025-03-17 05:30:04,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:04" (1/1) ... [2025-03-17 05:30:04,553 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:04" (1/1) ... [2025-03-17 05:30:04,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:04" (1/1) ... [2025-03-17 05:30:04,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:04" (1/1) ... [2025-03-17 05:30:04,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:04" (1/1) ... [2025-03-17 05:30:04,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:30:04,563 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:30:04,563 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:30:04,563 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:30:04,563 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:04" (1/1) ... [2025-03-17 05:30:04,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:30:04,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:30:04,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:30:04,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:30:04,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:30:04,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:30:04,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:30:04,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:30:04,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:30:04,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:30:04,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:30:04,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:30:04,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:30:04,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:30:04,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:30:04,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:30:04,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:30:04,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:30:04,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:30:04,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:30:04,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:30:04,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:30:04,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:30:04,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:30:04,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:30:04,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:30:04,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:30:04,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:30:04,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:30:04,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:30:04,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:30:04,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:30:04,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:30:04,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:30:04,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:30:04,611 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:30:04,611 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:30:04,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:30:04,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:30:04,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:30:04,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:30:04,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:30:04,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:30:04,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:30:04,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:30:04,728 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:30:04,729 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:30:05,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: havoc property_#t~mem64#1;havoc property_#t~ite77#1;havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~ite76#1;havoc property_#t~mem67#1;havoc property_#t~ite74#1;havoc property_#t~mem71#1;havoc property_#t~mem70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem73#1;havoc property_#t~mem72#1;havoc property_#t~mem75#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~ite91#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~mem83#1;havoc property_#t~bitwise84#1;havoc property_#t~mem85#1;havoc property_#t~ite90#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~ite103#1;havoc property_#t~mem97#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short96#1;havoc property_#t~mem102#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~short101#1;havoc property_#t~short104#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short107#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~short110#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short113#1; [2025-03-17 05:30:05,066 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-17 05:30:05,067 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:30:05,078 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:30:05,079 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:30:05,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:30:05 BoogieIcfgContainer [2025-03-17 05:30:05,080 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:30:05,082 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:30:05,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:30:05,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:30:05,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:30:04" (1/3) ... [2025-03-17 05:30:05,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165a1b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:30:05, skipping insertion in model container [2025-03-17 05:30:05,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:04" (2/3) ... [2025-03-17 05:30:05,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165a1b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:30:05, skipping insertion in model container [2025-03-17 05:30:05,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:30:05" (3/3) ... [2025-03-17 05:30:05,087 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-97.i [2025-03-17 05:30:05,098 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:30:05,099 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-97.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:30:05,140 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:30:05,147 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;@1b8e003b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:30:05,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:30:05,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 83 states have internal predecessors, (116), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:30:05,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:05,159 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:05,159 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:05,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:05,162 INFO L85 PathProgramCache]: Analyzing trace with hash 533579594, now seen corresponding path program 1 times [2025-03-17 05:30:05,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:05,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013580921] [2025-03-17 05:30:05,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:05,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:05,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:30:05,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:30:05,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:05,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 05:30:05,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:05,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013580921] [2025-03-17 05:30:05,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013580921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:30:05,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856757131] [2025-03-17 05:30:05,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:05,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:30:05,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:30:05,432 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:30:05,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:30:05,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:30:05,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:30:05,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:05,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:05,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:30:05,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:05,648 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 05:30:05,651 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:05,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856757131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:05,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:30:05,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:30:05,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149177328] [2025-03-17 05:30:05,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:05,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:30:05,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:05,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:30:05,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:30:05,669 INFO L87 Difference]: Start difference. First operand has 102 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 83 states have internal predecessors, (116), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:30:05,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:05,691 INFO L93 Difference]: Finished difference Result 201 states and 315 transitions. [2025-03-17 05:30:05,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:30:05,692 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2025-03-17 05:30:05,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:05,698 INFO L225 Difference]: With dead ends: 201 [2025-03-17 05:30:05,698 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 05:30:05,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-03-17 05:30:05,705 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:05,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:30:05,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 05:30:05,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-17 05:30:05,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.382716049382716) internal successors, (112), 81 states have internal predecessors, (112), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 146 transitions. [2025-03-17 05:30:05,734 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 146 transitions. Word has length 130 [2025-03-17 05:30:05,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:05,734 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 146 transitions. [2025-03-17 05:30:05,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:30:05,735 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 146 transitions. [2025-03-17 05:30:05,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:30:05,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:05,738 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:05,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:30:05,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:30:05,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:05,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:05,939 INFO L85 PathProgramCache]: Analyzing trace with hash -483811181, now seen corresponding path program 1 times [2025-03-17 05:30:05,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:05,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069928033] [2025-03-17 05:30:05,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:05,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:05,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:30:06,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:30:06,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:06,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:30:06,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:06,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069928033] [2025-03-17 05:30:06,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069928033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:30:06,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651524600] [2025-03-17 05:30:06,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:06,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:30:06,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:30:06,351 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:30:06,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:30:06,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:30:06,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:30:06,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:06,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:06,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:30:06,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:06,559 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:06,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651524600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:06,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:30:06,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 05:30:06,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370156561] [2025-03-17 05:30:06,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:06,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:30:06,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:06,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:30:06,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:30:06,561 INFO L87 Difference]: Start difference. First operand 100 states and 146 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:06,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:06,589 INFO L93 Difference]: Finished difference Result 202 states and 295 transitions. [2025-03-17 05:30:06,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:30:06,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2025-03-17 05:30:06,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:06,593 INFO L225 Difference]: With dead ends: 202 [2025-03-17 05:30:06,594 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 05:30:06,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 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-03-17 05:30:06,598 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:06,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 412 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:30:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 05:30:06,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-03-17 05:30:06,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:06,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 148 transitions. [2025-03-17 05:30:06,606 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 148 transitions. Word has length 130 [2025-03-17 05:30:06,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:06,607 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 148 transitions. [2025-03-17 05:30:06,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:06,607 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 148 transitions. [2025-03-17 05:30:06,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:30:06,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:06,609 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:06,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:30:06,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 05:30:06,813 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:06,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:06,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2003701652, now seen corresponding path program 1 times [2025-03-17 05:30:06,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:06,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263999981] [2025-03-17 05:30:06,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:06,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:06,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:30:06,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:30:06,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:06,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:07,045 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:30:07,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:07,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263999981] [2025-03-17 05:30:07,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263999981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:30:07,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401469655] [2025-03-17 05:30:07,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:07,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:30:07,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:30:07,048 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:30:07,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:30:07,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:30:07,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:30:07,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:07,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:07,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:30:07,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:07,240 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:07,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:07,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401469655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:07,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:30:07,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 05:30:07,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394578554] [2025-03-17 05:30:07,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:07,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:30:07,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:07,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:30:07,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:30:07,242 INFO L87 Difference]: Start difference. First operand 102 states and 148 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:07,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:07,272 INFO L93 Difference]: Finished difference Result 206 states and 299 transitions. [2025-03-17 05:30:07,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:30:07,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2025-03-17 05:30:07,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:07,274 INFO L225 Difference]: With dead ends: 206 [2025-03-17 05:30:07,274 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 05:30:07,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 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-03-17 05:30:07,275 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:07,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 413 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:30:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 05:30:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-03-17 05:30:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 85 states have internal predecessors, (116), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 150 transitions. [2025-03-17 05:30:07,289 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 150 transitions. Word has length 130 [2025-03-17 05:30:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:07,290 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 150 transitions. [2025-03-17 05:30:07,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 150 transitions. [2025-03-17 05:30:07,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:30:07,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:07,296 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:07,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:30:07,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:30:07,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:07,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:07,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1403761963, now seen corresponding path program 1 times [2025-03-17 05:30:07,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:07,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898098512] [2025-03-17 05:30:07,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:07,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:07,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:30:07,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:30:07,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:07,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:07,679 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:30:07,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:07,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898098512] [2025-03-17 05:30:07,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898098512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:30:07,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349509344] [2025-03-17 05:30:07,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:07,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:30:07,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:30:07,683 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:30:07,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:30:07,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:30:07,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:30:07,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:07,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:07,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:30:07,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:07,868 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:07,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:07,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349509344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:07,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:30:07,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 05:30:07,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607554053] [2025-03-17 05:30:07,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:07,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:30:07,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:07,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:30:07,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:30:07,889 INFO L87 Difference]: Start difference. First operand 104 states and 150 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:07,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:07,911 INFO L93 Difference]: Finished difference Result 210 states and 303 transitions. [2025-03-17 05:30:07,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:30:07,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2025-03-17 05:30:07,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:07,913 INFO L225 Difference]: With dead ends: 210 [2025-03-17 05:30:07,913 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 05:30:07,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 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-03-17 05:30:07,914 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:07,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 415 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:30:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 05:30:07,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2025-03-17 05:30:07,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2025-03-17 05:30:07,919 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 130 [2025-03-17 05:30:07,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:07,919 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2025-03-17 05:30:07,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:07,920 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2025-03-17 05:30:07,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:30:07,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:07,921 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:07,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 05:30:08,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:30:08,122 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:08,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:08,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1402838442, now seen corresponding path program 1 times [2025-03-17 05:30:08,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:08,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933619361] [2025-03-17 05:30:08,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:08,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:08,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:30:08,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:30:08,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:08,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:30:08,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:08,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933619361] [2025-03-17 05:30:08,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933619361] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:30:08,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416448516] [2025-03-17 05:30:08,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:08,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:30:08,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:30:08,264 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:30:08,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 05:30:08,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:30:08,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:30:08,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:08,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:08,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:30:08,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:08,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:08,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416448516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:08,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:30:08,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 05:30:08,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314579880] [2025-03-17 05:30:08,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:08,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:30:08,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:08,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:30:08,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:30:08,432 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:08,456 INFO L93 Difference]: Finished difference Result 213 states and 306 transitions. [2025-03-17 05:30:08,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:30:08,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2025-03-17 05:30:08,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:08,459 INFO L225 Difference]: With dead ends: 213 [2025-03-17 05:30:08,459 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 05:30:08,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 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-03-17 05:30:08,461 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:08,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:30:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 05:30:08,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-17 05:30:08,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.348314606741573) internal successors, (120), 89 states have internal predecessors, (120), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2025-03-17 05:30:08,470 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 130 [2025-03-17 05:30:08,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:08,471 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2025-03-17 05:30:08,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2025-03-17 05:30:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:30:08,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:08,472 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:08,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 05:30:08,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:30:08,673 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:08,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:08,674 INFO L85 PathProgramCache]: Analyzing trace with hash 225316016, now seen corresponding path program 1 times [2025-03-17 05:30:08,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:08,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137826486] [2025-03-17 05:30:08,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:08,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:08,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:30:08,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:30:08,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:08,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:09,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:09,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137826486] [2025-03-17 05:30:09,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137826486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:09,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:09,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:30:09,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512249065] [2025-03-17 05:30:09,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:09,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:30:09,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:09,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:30:09,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:30:09,103 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:09,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:09,356 INFO L93 Difference]: Finished difference Result 304 states and 431 transitions. [2025-03-17 05:30:09,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:30:09,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-17 05:30:09,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:09,357 INFO L225 Difference]: With dead ends: 304 [2025-03-17 05:30:09,357 INFO L226 Difference]: Without dead ends: 197 [2025-03-17 05:30:09,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:30:09,358 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 297 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:09,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 566 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:30:09,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-17 05:30:09,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 110. [2025-03-17 05:30:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2025-03-17 05:30:09,374 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 132 [2025-03-17 05:30:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:09,375 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2025-03-17 05:30:09,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2025-03-17 05:30:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:30:09,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:09,376 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:09,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:30:09,376 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:09,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:09,376 INFO L85 PathProgramCache]: Analyzing trace with hash 816621204, now seen corresponding path program 1 times [2025-03-17 05:30:09,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:09,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462736706] [2025-03-17 05:30:09,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:09,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:09,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:30:09,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:30:09,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:09,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:30:10,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:10,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462736706] [2025-03-17 05:30:10,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462736706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:30:10,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663410215] [2025-03-17 05:30:10,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:10,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:30:10,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:30:10,135 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:30:10,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 05:30:10,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:30:10,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:30:10,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:10,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:10,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 05:30:10,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:10,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-03-17 05:30:10,591 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-03-17 05:30:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 16 proven. 48 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:30:10,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:30:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:30:10,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663410215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:30:10,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:30:10,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2025-03-17 05:30:10,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709625660] [2025-03-17 05:30:10,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:30:10,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 05:30:10,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:10,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 05:30:10,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:30:10,935 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 19 states, 16 states have (on average 4.5625) internal successors, (73), 19 states have internal predecessors, (73), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 1 states have call predecessors, (35), 4 states have call successors, (35) [2025-03-17 05:30:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:11,651 INFO L93 Difference]: Finished difference Result 340 states and 476 transitions. [2025-03-17 05:30:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 05:30:11,651 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 4.5625) internal successors, (73), 19 states have internal predecessors, (73), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 1 states have call predecessors, (35), 4 states have call successors, (35) Word has length 132 [2025-03-17 05:30:11,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:11,653 INFO L225 Difference]: With dead ends: 340 [2025-03-17 05:30:11,653 INFO L226 Difference]: Without dead ends: 231 [2025-03-17 05:30:11,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 255 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=1121, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 05:30:11,654 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 502 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:11,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1065 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:30:11,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-17 05:30:11,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 125. [2025-03-17 05:30:11,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 175 transitions. [2025-03-17 05:30:11,664 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 175 transitions. Word has length 132 [2025-03-17 05:30:11,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:11,665 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 175 transitions. [2025-03-17 05:30:11,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 4.5625) internal successors, (73), 19 states have internal predecessors, (73), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 1 states have call predecessors, (35), 4 states have call successors, (35) [2025-03-17 05:30:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 175 transitions. [2025-03-17 05:30:11,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:30:11,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:11,666 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:11,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 05:30:11,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:30:11,867 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:11,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:11,868 INFO L85 PathProgramCache]: Analyzing trace with hash 749614451, now seen corresponding path program 1 times [2025-03-17 05:30:11,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:11,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342779627] [2025-03-17 05:30:11,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:11,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:11,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:30:11,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:30:11,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:11,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:12,249 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:30:12,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:12,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342779627] [2025-03-17 05:30:12,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342779627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:30:12,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200079647] [2025-03-17 05:30:12,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:12,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:30:12,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:30:12,251 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:30:12,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 05:30:12,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:30:12,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:30:12,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:12,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:12,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:30:12,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:12,418 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-03-17 05:30:12,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2025-03-17 05:30:12,624 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 132 proven. 42 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-17 05:30:12,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:30:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:30:12,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200079647] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:30:12,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:30:12,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2025-03-17 05:30:12,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961753697] [2025-03-17 05:30:12,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:30:12,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:30:12,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:12,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:30:12,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:30:12,822 INFO L87 Difference]: Start difference. First operand 125 states and 175 transitions. Second operand has 13 states, 9 states have (on average 7.222222222222222) internal successors, (65), 13 states have internal predecessors, (65), 7 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 3 states have call predecessors, (36), 7 states have call successors, (36) [2025-03-17 05:30:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:13,169 INFO L93 Difference]: Finished difference Result 263 states and 363 transitions. [2025-03-17 05:30:13,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:30:13,170 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 7.222222222222222) internal successors, (65), 13 states have internal predecessors, (65), 7 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 3 states have call predecessors, (36), 7 states have call successors, (36) Word has length 132 [2025-03-17 05:30:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:13,171 INFO L225 Difference]: With dead ends: 263 [2025-03-17 05:30:13,171 INFO L226 Difference]: Without dead ends: 139 [2025-03-17 05:30:13,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 260 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:30:13,172 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 195 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:13,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 471 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:30:13,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-17 05:30:13,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2025-03-17 05:30:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 112 states have (on average 1.3125) internal successors, (147), 113 states have internal predecessors, (147), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:30:13,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 185 transitions. [2025-03-17 05:30:13,182 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 185 transitions. Word has length 132 [2025-03-17 05:30:13,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:13,182 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 185 transitions. [2025-03-17 05:30:13,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 7.222222222222222) internal successors, (65), 13 states have internal predecessors, (65), 7 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 3 states have call predecessors, (36), 7 states have call successors, (36) [2025-03-17 05:30:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 185 transitions. [2025-03-17 05:30:13,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:30:13,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:13,185 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:13,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 05:30:13,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:30:13,386 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:13,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:13,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1513782040, now seen corresponding path program 1 times [2025-03-17 05:30:13,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:13,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229879877] [2025-03-17 05:30:13,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:13,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:13,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:30:13,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:30:13,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:13,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:13,919 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:30:13,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:13,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229879877] [2025-03-17 05:30:13,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229879877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:30:13,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472043533] [2025-03-17 05:30:13,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:13,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:30:13,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:30:13,922 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:30:13,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 05:30:14,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:30:14,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:30:14,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:14,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:14,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:30:14,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:14,292 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-03-17 05:30:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 132 proven. 42 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-17 05:30:14,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:30:14,546 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:30:14,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472043533] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:30:14,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:30:14,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2025-03-17 05:30:14,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964616056] [2025-03-17 05:30:14,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:30:14,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 05:30:14,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:14,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 05:30:14,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:30:14,548 INFO L87 Difference]: Start difference. First operand 136 states and 185 transitions. Second operand has 20 states, 16 states have (on average 4.75) internal successors, (76), 20 states have internal predecessors, (76), 7 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 3 states have call predecessors, (36), 7 states have call successors, (36) [2025-03-17 05:30:15,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:15,342 INFO L93 Difference]: Finished difference Result 371 states and 505 transitions. [2025-03-17 05:30:15,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 05:30:15,342 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 4.75) internal successors, (76), 20 states have internal predecessors, (76), 7 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 3 states have call predecessors, (36), 7 states have call successors, (36) Word has length 132 [2025-03-17 05:30:15,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:15,344 INFO L225 Difference]: With dead ends: 371 [2025-03-17 05:30:15,344 INFO L226 Difference]: Without dead ends: 244 [2025-03-17 05:30:15,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=1325, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 05:30:15,345 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 717 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:15,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 1201 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:30:15,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-17 05:30:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 231. [2025-03-17 05:30:15,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 189 states have internal predecessors, (243), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:30:15,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 315 transitions. [2025-03-17 05:30:15,369 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 315 transitions. Word has length 132 [2025-03-17 05:30:15,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:15,371 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 315 transitions. [2025-03-17 05:30:15,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 4.75) internal successors, (76), 20 states have internal predecessors, (76), 7 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 3 states have call predecessors, (36), 7 states have call successors, (36) [2025-03-17 05:30:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 315 transitions. [2025-03-17 05:30:15,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 05:30:15,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:15,372 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:15,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 05:30:15,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-17 05:30:15,573 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:15,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:15,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1882616557, now seen corresponding path program 1 times [2025-03-17 05:30:15,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:15,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631255755] [2025-03-17 05:30:15,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:15,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:15,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:30:15,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:30:15,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:15,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:15,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:15,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631255755] [2025-03-17 05:30:15,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631255755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:15,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:15,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:30:15,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52052406] [2025-03-17 05:30:15,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:15,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:30:15,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:15,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:30:15,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:30:15,713 INFO L87 Difference]: Start difference. First operand 231 states and 315 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:15,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:15,834 INFO L93 Difference]: Finished difference Result 681 states and 933 transitions. [2025-03-17 05:30:15,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:30:15,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2025-03-17 05:30:15,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:15,837 INFO L225 Difference]: With dead ends: 681 [2025-03-17 05:30:15,838 INFO L226 Difference]: Without dead ends: 459 [2025-03-17 05:30:15,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:30:15,839 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 137 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:15,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 941 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:30:15,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-03-17 05:30:15,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 235. [2025-03-17 05:30:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 193 states have internal predecessors, (249), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:30:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 321 transitions. [2025-03-17 05:30:15,857 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 321 transitions. Word has length 133 [2025-03-17 05:30:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:15,857 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 321 transitions. [2025-03-17 05:30:15,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 321 transitions. [2025-03-17 05:30:15,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 05:30:15,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:15,858 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:15,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:30:15,859 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:15,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1291311369, now seen corresponding path program 1 times [2025-03-17 05:30:15,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:15,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925654288] [2025-03-17 05:30:15,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:15,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:15,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:30:15,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:30:15,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:15,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:16,121 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:16,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:16,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925654288] [2025-03-17 05:30:16,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925654288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:16,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:16,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:30:16,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395185636] [2025-03-17 05:30:16,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:16,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:30:16,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:16,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:30:16,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:30:16,123 INFO L87 Difference]: Start difference. First operand 235 states and 321 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:16,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:16,244 INFO L93 Difference]: Finished difference Result 459 states and 630 transitions. [2025-03-17 05:30:16,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:30:16,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2025-03-17 05:30:16,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:16,246 INFO L225 Difference]: With dead ends: 459 [2025-03-17 05:30:16,246 INFO L226 Difference]: Without dead ends: 233 [2025-03-17 05:30:16,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:30:16,249 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 221 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:16,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 333 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:30:16,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-17 05:30:16,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2025-03-17 05:30:16,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 189 states have (on average 1.291005291005291) internal successors, (244), 191 states have internal predecessors, (244), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:30:16,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 316 transitions. [2025-03-17 05:30:16,268 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 316 transitions. Word has length 133 [2025-03-17 05:30:16,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:16,270 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 316 transitions. [2025-03-17 05:30:16,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 316 transitions. [2025-03-17 05:30:16,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 05:30:16,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:16,272 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:16,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:30:16,274 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:16,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:16,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1115073138, now seen corresponding path program 1 times [2025-03-17 05:30:16,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:16,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461895969] [2025-03-17 05:30:16,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:16,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:16,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 05:30:16,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 05:30:16,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:16,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:16,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:16,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461895969] [2025-03-17 05:30:16,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461895969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:16,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:16,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:30:16,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018701442] [2025-03-17 05:30:16,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:16,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:30:16,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:16,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:30:16,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:30:16,647 INFO L87 Difference]: Start difference. First operand 233 states and 316 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:16,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:16,895 INFO L93 Difference]: Finished difference Result 605 states and 814 transitions. [2025-03-17 05:30:16,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:30:16,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-03-17 05:30:16,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:16,898 INFO L225 Difference]: With dead ends: 605 [2025-03-17 05:30:16,898 INFO L226 Difference]: Without dead ends: 381 [2025-03-17 05:30:16,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:30:16,899 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 197 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:16,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 837 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:30:16,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-17 05:30:16,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 175. [2025-03-17 05:30:16,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 133 states have (on average 1.2330827067669172) internal successors, (164), 134 states have internal predecessors, (164), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:30:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 232 transitions. [2025-03-17 05:30:16,914 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 232 transitions. Word has length 134 [2025-03-17 05:30:16,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:16,915 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 232 transitions. [2025-03-17 05:30:16,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:16,915 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 232 transitions. [2025-03-17 05:30:16,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:30:16,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:16,916 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:16,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:30:16,916 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:16,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:16,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1524219029, now seen corresponding path program 1 times [2025-03-17 05:30:16,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:16,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838037803] [2025-03-17 05:30:16,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:16,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:16,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:30:16,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:30:16,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:16,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:17,233 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:17,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:17,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838037803] [2025-03-17 05:30:17,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838037803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:17,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:17,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:30:17,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156887346] [2025-03-17 05:30:17,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:17,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:30:17,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:17,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:30:17,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:30:17,235 INFO L87 Difference]: Start difference. First operand 175 states and 232 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:17,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:17,475 INFO L93 Difference]: Finished difference Result 397 states and 524 transitions. [2025-03-17 05:30:17,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:30:17,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-03-17 05:30:17,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:17,477 INFO L225 Difference]: With dead ends: 397 [2025-03-17 05:30:17,477 INFO L226 Difference]: Without dead ends: 270 [2025-03-17 05:30:17,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:30:17,477 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 266 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:17,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 478 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:30:17,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-17 05:30:17,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 178. [2025-03-17 05:30:17,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 136 states have (on average 1.2205882352941178) internal successors, (166), 137 states have internal predecessors, (166), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:30:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 234 transitions. [2025-03-17 05:30:17,492 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 234 transitions. Word has length 135 [2025-03-17 05:30:17,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:17,492 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 234 transitions. [2025-03-17 05:30:17,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 234 transitions. [2025-03-17 05:30:17,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:30:17,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:17,493 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:17,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:30:17,493 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:17,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:17,494 INFO L85 PathProgramCache]: Analyzing trace with hash -688646639, now seen corresponding path program 1 times [2025-03-17 05:30:17,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:17,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919194529] [2025-03-17 05:30:17,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:17,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:17,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:30:17,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:30:17,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:17,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:18,230 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:18,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:18,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919194529] [2025-03-17 05:30:18,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919194529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:18,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:18,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:30:18,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281291471] [2025-03-17 05:30:18,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:18,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:30:18,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:18,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:30:18,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:30:18,232 INFO L87 Difference]: Start difference. First operand 178 states and 234 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:30:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:18,421 INFO L93 Difference]: Finished difference Result 389 states and 506 transitions. [2025-03-17 05:30:18,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:30:18,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-03-17 05:30:18,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:18,423 INFO L225 Difference]: With dead ends: 389 [2025-03-17 05:30:18,423 INFO L226 Difference]: Without dead ends: 263 [2025-03-17 05:30:18,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:30:18,425 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 79 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:18,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 871 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:30:18,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-17 05:30:18,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 200. [2025-03-17 05:30:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 158 states have (on average 1.2215189873417722) internal successors, (193), 159 states have internal predecessors, (193), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:30:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 261 transitions. [2025-03-17 05:30:18,447 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 261 transitions. Word has length 135 [2025-03-17 05:30:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:18,447 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 261 transitions. [2025-03-17 05:30:18,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:30:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 261 transitions. [2025-03-17 05:30:18,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:30:18,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:18,448 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:18,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:30:18,449 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:18,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:18,449 INFO L85 PathProgramCache]: Analyzing trace with hash 399069776, now seen corresponding path program 1 times [2025-03-17 05:30:18,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:18,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924897670] [2025-03-17 05:30:18,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:18,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:18,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:30:18,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:30:18,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:18,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:18,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:18,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924897670] [2025-03-17 05:30:18,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924897670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:18,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:18,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:30:18,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790198935] [2025-03-17 05:30:18,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:18,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:30:18,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:18,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:30:18,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:30:18,631 INFO L87 Difference]: Start difference. First operand 200 states and 261 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:18,743 INFO L93 Difference]: Finished difference Result 348 states and 453 transitions. [2025-03-17 05:30:18,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:30:18,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-03-17 05:30:18,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:18,744 INFO L225 Difference]: With dead ends: 348 [2025-03-17 05:30:18,745 INFO L226 Difference]: Without dead ends: 200 [2025-03-17 05:30:18,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:30:18,745 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 134 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:18,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 331 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:30:18,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-17 05:30:18,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-03-17 05:30:18,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 158 states have (on average 1.2088607594936709) internal successors, (191), 159 states have internal predecessors, (191), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:30:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 259 transitions. [2025-03-17 05:30:18,760 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 259 transitions. Word has length 136 [2025-03-17 05:30:18,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:18,760 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 259 transitions. [2025-03-17 05:30:18,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:18,761 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 259 transitions. [2025-03-17 05:30:18,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:30:18,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:18,761 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:18,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:30:18,762 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:18,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:18,762 INFO L85 PathProgramCache]: Analyzing trace with hash 187718863, now seen corresponding path program 1 times [2025-03-17 05:30:18,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:18,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597840082] [2025-03-17 05:30:18,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:18,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:18,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:30:18,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:30:18,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:18,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:19,519 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:19,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:19,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597840082] [2025-03-17 05:30:19,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597840082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:19,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:19,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:30:19,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974756198] [2025-03-17 05:30:19,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:19,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:30:19,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:19,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:30:19,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:30:19,521 INFO L87 Difference]: Start difference. First operand 200 states and 259 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:30:19,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:19,752 INFO L93 Difference]: Finished difference Result 436 states and 560 transitions. [2025-03-17 05:30:19,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:30:19,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2025-03-17 05:30:19,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:19,755 INFO L225 Difference]: With dead ends: 436 [2025-03-17 05:30:19,755 INFO L226 Difference]: Without dead ends: 288 [2025-03-17 05:30:19,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:30:19,757 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 91 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:19,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1255 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:30:19,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-17 05:30:19,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 285. [2025-03-17 05:30:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 230 states have (on average 1.2173913043478262) internal successors, (280), 232 states have internal predecessors, (280), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-17 05:30:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 366 transitions. [2025-03-17 05:30:19,787 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 366 transitions. Word has length 136 [2025-03-17 05:30:19,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:19,787 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 366 transitions. [2025-03-17 05:30:19,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:30:19,787 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 366 transitions. [2025-03-17 05:30:19,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:30:19,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:19,789 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:19,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:30:19,789 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:19,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:19,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1541028560, now seen corresponding path program 1 times [2025-03-17 05:30:19,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:19,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656125515] [2025-03-17 05:30:19,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:19,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:19,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:30:19,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:30:19,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:19,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:20,046 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:20,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:20,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656125515] [2025-03-17 05:30:20,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656125515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:20,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:20,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:30:20,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561383604] [2025-03-17 05:30:20,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:20,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:30:20,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:20,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:30:20,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:30:20,050 INFO L87 Difference]: Start difference. First operand 285 states and 366 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:20,213 INFO L93 Difference]: Finished difference Result 510 states and 653 transitions. [2025-03-17 05:30:20,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:30:20,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-03-17 05:30:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:20,215 INFO L225 Difference]: With dead ends: 510 [2025-03-17 05:30:20,215 INFO L226 Difference]: Without dead ends: 277 [2025-03-17 05:30:20,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:30:20,217 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 209 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:20,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 324 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:30:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-17 05:30:20,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2025-03-17 05:30:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 222 states have (on average 1.2072072072072073) internal successors, (268), 224 states have internal predecessors, (268), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-17 05:30:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 354 transitions. [2025-03-17 05:30:20,258 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 354 transitions. Word has length 136 [2025-03-17 05:30:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:20,259 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 354 transitions. [2025-03-17 05:30:20,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:20,259 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 354 transitions. [2025-03-17 05:30:20,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:30:20,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:20,260 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:20,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:30:20,260 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:20,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:20,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1594411572, now seen corresponding path program 1 times [2025-03-17 05:30:20,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:20,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916620410] [2025-03-17 05:30:20,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:20,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:20,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:30:20,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:30:20,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:20,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:20,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:20,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916620410] [2025-03-17 05:30:20,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916620410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:20,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:20,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:30:20,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724019558] [2025-03-17 05:30:20,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:20,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:30:20,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:20,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:30:20,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:30:20,534 INFO L87 Difference]: Start difference. First operand 277 states and 354 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:30:20,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:20,700 INFO L93 Difference]: Finished difference Result 502 states and 639 transitions. [2025-03-17 05:30:20,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:30:20,701 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), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2025-03-17 05:30:20,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:20,704 INFO L225 Difference]: With dead ends: 502 [2025-03-17 05:30:20,704 INFO L226 Difference]: Without dead ends: 277 [2025-03-17 05:30:20,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:30:20,705 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 133 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:20,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 246 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:30:20,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-17 05:30:20,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2025-03-17 05:30:20,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 222 states have (on average 1.2027027027027026) internal successors, (267), 224 states have internal predecessors, (267), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-17 05:30:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 353 transitions. [2025-03-17 05:30:20,735 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 353 transitions. Word has length 138 [2025-03-17 05:30:20,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:20,735 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 353 transitions. [2025-03-17 05:30:20,735 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), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:30:20,735 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 353 transitions. [2025-03-17 05:30:20,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:30:20,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:20,736 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:20,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:30:20,736 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:20,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:20,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1535516714, now seen corresponding path program 1 times [2025-03-17 05:30:20,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:20,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311974858] [2025-03-17 05:30:20,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:20,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:20,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:30:20,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:30:20,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:20,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:20,904 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:20,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:20,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311974858] [2025-03-17 05:30:20,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311974858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:20,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:20,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:30:20,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968690274] [2025-03-17 05:30:20,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:20,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:30:20,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:20,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:30:20,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:30:20,905 INFO L87 Difference]: Start difference. First operand 277 states and 353 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:21,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:21,191 INFO L93 Difference]: Finished difference Result 809 states and 1030 transitions. [2025-03-17 05:30:21,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:30:21,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-17 05:30:21,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:21,194 INFO L225 Difference]: With dead ends: 809 [2025-03-17 05:30:21,194 INFO L226 Difference]: Without dead ends: 584 [2025-03-17 05:30:21,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:30:21,195 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 211 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:21,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 835 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:30:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-03-17 05:30:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 579. [2025-03-17 05:30:21,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 468 states have (on average 1.2179487179487178) internal successors, (570), 472 states have internal predecessors, (570), 86 states have call successors, (86), 24 states have call predecessors, (86), 24 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 05:30:21,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 742 transitions. [2025-03-17 05:30:21,247 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 742 transitions. Word has length 139 [2025-03-17 05:30:21,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:21,247 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 742 transitions. [2025-03-17 05:30:21,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 742 transitions. [2025-03-17 05:30:21,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:30:21,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:21,249 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:21,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:30:21,249 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:21,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:21,249 INFO L85 PathProgramCache]: Analyzing trace with hash -325752823, now seen corresponding path program 1 times [2025-03-17 05:30:21,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:21,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834624158] [2025-03-17 05:30:21,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:21,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:21,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:30:21,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:30:21,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:21,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:30:21,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:21,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834624158] [2025-03-17 05:30:21,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834624158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:30:21,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683129293] [2025-03-17 05:30:21,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:21,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:30:21,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:30:21,356 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:30:21,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 05:30:21,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:30:21,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:30:21,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:21,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:21,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:30:21,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:21,562 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:21,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:21,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683129293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:21,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:30:21,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-17 05:30:21,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328630755] [2025-03-17 05:30:21,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:21,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:30:21,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:21,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:30:21,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:30:21,563 INFO L87 Difference]: Start difference. First operand 579 states and 742 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:21,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:21,635 INFO L93 Difference]: Finished difference Result 1126 states and 1440 transitions. [2025-03-17 05:30:21,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:30:21,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-17 05:30:21,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:21,638 INFO L225 Difference]: With dead ends: 1126 [2025-03-17 05:30:21,638 INFO L226 Difference]: Without dead ends: 599 [2025-03-17 05:30:21,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:30:21,639 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:21,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:30:21,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-17 05:30:21,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 593. [2025-03-17 05:30:21,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 482 states have (on average 1.2116182572614107) internal successors, (584), 486 states have internal predecessors, (584), 86 states have call successors, (86), 24 states have call predecessors, (86), 24 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 05:30:21,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 756 transitions. [2025-03-17 05:30:21,690 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 756 transitions. Word has length 139 [2025-03-17 05:30:21,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:21,691 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 756 transitions. [2025-03-17 05:30:21,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:21,691 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 756 transitions. [2025-03-17 05:30:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:30:21,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:21,692 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:21,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 05:30:21,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:30:21,893 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:21,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:21,894 INFO L85 PathProgramCache]: Analyzing trace with hash -619776854, now seen corresponding path program 1 times [2025-03-17 05:30:21,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:21,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170363331] [2025-03-17 05:30:21,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:21,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:21,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:30:21,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:30:21,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:21,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:22,108 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:22,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:30:22,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170363331] [2025-03-17 05:30:22,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170363331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:22,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:22,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:30:22,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552321347] [2025-03-17 05:30:22,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:22,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:30:22,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:30:22,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:30:22,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:30:22,110 INFO L87 Difference]: Start difference. First operand 593 states and 756 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:22,233 INFO L93 Difference]: Finished difference Result 610 states and 777 transitions. [2025-03-17 05:30:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:30:22,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-17 05:30:22,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:22,237 INFO L225 Difference]: With dead ends: 610 [2025-03-17 05:30:22,237 INFO L226 Difference]: Without dead ends: 608 [2025-03-17 05:30:22,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:30:22,238 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 75 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:22,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 618 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:30:22,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-17 05:30:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2025-03-17 05:30:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 497 states have (on average 1.20523138832998) internal successors, (599), 501 states have internal predecessors, (599), 86 states have call successors, (86), 24 states have call predecessors, (86), 24 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 05:30:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 771 transitions. [2025-03-17 05:30:22,303 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 771 transitions. Word has length 139 [2025-03-17 05:30:22,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:22,303 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 771 transitions. [2025-03-17 05:30:22,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:22,304 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 771 transitions. [2025-03-17 05:30:22,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:30:22,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:22,305 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:22,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:30:22,305 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:22,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:22,306 INFO L85 PathProgramCache]: Analyzing trace with hash -618853333, now seen corresponding path program 1 times [2025-03-17 05:30:22,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:30:22,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983701210] [2025-03-17 05:30:22,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:22,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:30:22,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:30:22,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:30:22,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:22,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:30:22,359 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:30:22,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:30:22,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:30:22,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:22,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:30:22,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:30:22,449 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:30:22,450 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:30:22,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 05:30:22,454 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:22,519 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:30:22,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:30:22 BoogieIcfgContainer [2025-03-17 05:30:22,522 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:30:22,523 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:30:22,523 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:30:22,523 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:30:22,523 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:30:05" (3/4) ... [2025-03-17 05:30:22,525 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:30:22,526 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:30:22,526 INFO L158 Benchmark]: Toolchain (without parser) took 18287.71ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 114.0MB in the beginning and 641.3MB in the end (delta: -527.3MB). Peak memory consumption was 197.5MB. Max. memory is 16.1GB. [2025-03-17 05:30:22,526 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:30:22,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.60ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 99.6MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:30:22,527 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.26ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 96.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:30:22,528 INFO L158 Benchmark]: Boogie Preprocessor took 55.23ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 92.8MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:30:22,528 INFO L158 Benchmark]: IcfgBuilder took 517.23ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 61.2MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:30:22,528 INFO L158 Benchmark]: TraceAbstraction took 17440.46ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 60.7MB in the beginning and 645.5MB in the end (delta: -584.8MB). Peak memory consumption was 147.2MB. Max. memory is 16.1GB. [2025-03-17 05:30:22,528 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 872.4MB. Free memory was 645.5MB in the beginning and 641.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:30:22,529 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.14ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.60ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 99.6MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.26ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 96.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.23ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 92.8MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 517.23ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 61.2MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17440.46ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 60.7MB in the beginning and 645.5MB in the end (delta: -584.8MB). Peak memory consumption was 147.2MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 872.4MB. Free memory was 645.5MB in the beginning and 641.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 43, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 0 }; [L25-L27] float float_Array_0[2] = { 32.5, 127.4 }; [L25-L27] float float_Array_0[2] = { 32.5, 127.4 }; [L25-L27] float float_Array_0[2] = { 32.5, 127.4 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, 100, -1 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, 100, -1 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, 100, -1 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, 100, -1 }; [L31-L33] signed short int signed_short_int_Array_0[5] = { 100, 20113, 128, 32, 16 }; [L31-L33] signed short int signed_short_int_Array_0[5] = { 100, 20113, 128, 32, 16 }; [L31-L33] signed short int signed_short_int_Array_0[5] = { 100, 20113, 128, 32, 16 }; [L31-L33] signed short int signed_short_int_Array_0[5] = { 100, 20113, 128, 32, 16 }; [L31-L33] signed short int signed_short_int_Array_0[5] = { 100, 20113, 128, 32, 16 }; [L31-L33] signed short int signed_short_int_Array_0[5] = { 100, 20113, 128, 32, 16 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 10, 256 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 10, 256 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 10, 256 }; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L70] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] float_Array_0[1] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[1] [L77] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L77] EXPR float_Array_0[1] [L77] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L79] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] CALL assume_abort_if_not(signed_char_Array_0[0] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] RET assume_abort_if_not(signed_char_Array_0[0] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[0] <= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[0] <= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L82] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] CALL assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] RET assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L85] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L88] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L88] RET assume_abort_if_not(signed_short_int_Array_0[1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] signed_short_int_Array_0[3] = __VERIFIER_nondet_short() [L91] EXPR signed_short_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L91] CALL assume_abort_if_not(signed_short_int_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L91] RET assume_abort_if_not(signed_short_int_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR signed_short_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(signed_short_int_Array_0[3] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] RET assume_abort_if_not(signed_short_int_Array_0[3] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L94] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L108] RET updateVariables() [L109] CALL step() [L40] EXPR unsigned_short_int_Array_0[1] [L40] unsigned_short_int_Array_0[0] = unsigned_short_int_Array_0[1] [L41] EXPR float_Array_0[1] [L41] float_Array_0[0] = float_Array_0[1] [L42] EXPR signed_char_Array_0[0] [L42] signed_short_int_Array_0[2] = signed_char_Array_0[0] [L43] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L43] COND TRUE 127.5f > float_Array_0[0] [L44] EXPR BOOL_unsigned_char_Array_0[2] [L44] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1] [L44] EXPR BOOL_unsigned_char_Array_0[1] [L44] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] BOOL_unsigned_char_Array_0[0] = (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]) [L48] EXPR unsigned_short_int_Array_0[0] [L48] EXPR signed_short_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L48] COND TRUE unsigned_short_int_Array_0[0] == signed_short_int_Array_0[3] [L49] EXPR signed_char_Array_0[2] [L49] EXPR signed_char_Array_0[0] [L49] signed_char_Array_0[1] = (signed_char_Array_0[2] + (signed_char_Array_0[0] + -25)) [L57] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] COND TRUE BOOL_unsigned_char_Array_0[0] [L58] EXPR signed_char_Array_0[1] [L58] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] COND FALSE !(signed_char_Array_0[1] > signed_short_int_Array_0[2]) [L65] signed_short_int_Array_0[4] = 8 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR BOOL_unsigned_char_Array_0[0] ? ((signed_char_Array_0[1] > signed_short_int_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[4] == ((signed short int) (signed_short_int_Array_0[3] - (signed_short_int_Array_0[1] - signed_short_int_Array_0[0])))) : (signed_short_int_Array_0[4] == ((signed short int) unsigned_short_int_Array_0[0]))) : (signed_short_int_Array_0[4] == ((signed short int) 8))) : 1 [L100] EXPR signed_char_Array_0[1] [L100] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (signed_char_Array_0[1] > signed_short_int_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[4] == ((signed short int) (signed_short_int_Array_0[3] - (signed_short_int_Array_0[1] - signed_short_int_Array_0[0])))) : (signed_short_int_Array_0[4] == ((signed short int) unsigned_short_int_Array_0[0]))) : (signed_short_int_Array_0[4] == ((signed short int) 8)) [L100] EXPR signed_short_int_Array_0[4] [L100] EXPR (signed_char_Array_0[1] > signed_short_int_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[4] == ((signed short int) (signed_short_int_Array_0[3] - (signed_short_int_Array_0[1] - signed_short_int_Array_0[0])))) : (signed_short_int_Array_0[4] == ((signed short int) unsigned_short_int_Array_0[0]))) : (signed_short_int_Array_0[4] == ((signed short int) 8)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR BOOL_unsigned_char_Array_0[0] ? ((signed_char_Array_0[1] > signed_short_int_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[4] == ((signed short int) (signed_short_int_Array_0[3] - (signed_short_int_Array_0[1] - signed_short_int_Array_0[0])))) : (signed_short_int_Array_0[4] == ((signed short int) unsigned_short_int_Array_0[0]))) : (signed_short_int_Array_0[4] == ((signed short int) 8))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[0] ? ((signed_char_Array_0[1] > signed_short_int_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[4] == ((signed short int) (signed_short_int_Array_0[3] - (signed_short_int_Array_0[1] - signed_short_int_Array_0[0])))) : (signed_short_int_Array_0[4] == ((signed short int) unsigned_short_int_Array_0[0]))) : (signed_short_int_Array_0[4] == ((signed short int) 8))) : 1) && ((unsigned_short_int_Array_0[0] == signed_short_int_Array_0[3]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + (signed_char_Array_0[0] + -25)))) : ((((32 * -25) | signed_short_int_Array_0[2]) >= signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[0] ? ((signed_char_Array_0[1] > signed_short_int_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[4] == ((signed short int) (signed_short_int_Array_0[3] - (signed_short_int_Array_0[1] - signed_short_int_Array_0[0])))) : (signed_short_int_Array_0[4] == ((signed short int) unsigned_short_int_Array_0[0]))) : (signed_short_int_Array_0[4] == ((signed short int) 8))) : 1) && ((unsigned_short_int_Array_0[0] == signed_short_int_Array_0[3]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + (signed_char_Array_0[0] + -25)))) : ((((32 * -25) | signed_short_int_Array_0[2]) >= signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : 1)) [L100] EXPR unsigned_short_int_Array_0[0] [L100] EXPR signed_short_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (unsigned_short_int_Array_0[0] == signed_short_int_Array_0[3]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + (signed_char_Array_0[0] + -25)))) : ((((32 * -25) | signed_short_int_Array_0[2]) >= signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : 1) [L100] EXPR signed_char_Array_0[1] [L100] EXPR signed_char_Array_0[2] [L100] EXPR signed_char_Array_0[0] [L100] EXPR (unsigned_short_int_Array_0[0] == signed_short_int_Array_0[3]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + (signed_char_Array_0[0] + -25)))) : ((((32 * -25) | signed_short_int_Array_0[2]) >= signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[0] ? ((signed_char_Array_0[1] > signed_short_int_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[4] == ((signed short int) (signed_short_int_Array_0[3] - (signed_short_int_Array_0[1] - signed_short_int_Array_0[0])))) : (signed_short_int_Array_0[4] == ((signed short int) unsigned_short_int_Array_0[0]))) : (signed_short_int_Array_0[4] == ((signed short int) 8))) : 1) && ((unsigned_short_int_Array_0[0] == signed_short_int_Array_0[3]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + (signed_char_Array_0[0] + -25)))) : ((((32 * -25) | signed_short_int_Array_0[2]) >= signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((BOOL_unsigned_char_Array_0[0] ? ((signed_char_Array_0[1] > signed_short_int_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[4] == ((signed short int) (signed_short_int_Array_0[3] - (signed_short_int_Array_0[1] - signed_short_int_Array_0[0])))) : (signed_short_int_Array_0[4] == ((signed short int) unsigned_short_int_Array_0[0]))) : (signed_short_int_Array_0[4] == ((signed short int) 8))) : 1) && ((unsigned_short_int_Array_0[0] == signed_short_int_Array_0[3]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + (signed_char_Array_0[0] + -25)))) : ((((32 * -25) | signed_short_int_Array_0[2]) >= signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : 1))) && ((127.5f > float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) ((float_Array_0[0] >= float_Array_0[0]) || BOOL_unsigned_char_Array_0[2])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((BOOL_unsigned_char_Array_0[0] ? ((signed_char_Array_0[1] > signed_short_int_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[4] == ((signed short int) (signed_short_int_Array_0[3] - (signed_short_int_Array_0[1] - signed_short_int_Array_0[0])))) : (signed_short_int_Array_0[4] == ((signed short int) unsigned_short_int_Array_0[0]))) : (signed_short_int_Array_0[4] == ((signed short int) 8))) : 1) && ((unsigned_short_int_Array_0[0] == signed_short_int_Array_0[3]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + (signed_char_Array_0[0] + -25)))) : ((((32 * -25) | signed_short_int_Array_0[2]) >= signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : 1))) && ((127.5f > float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) ((float_Array_0[0] >= float_Array_0[0]) || BOOL_unsigned_char_Array_0[2])))) [L100] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (127.5f > float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) ((float_Array_0[0] >= float_Array_0[0]) || BOOL_unsigned_char_Array_0[2]))) [L100] EXPR BOOL_unsigned_char_Array_0[0] [L100] EXPR BOOL_unsigned_char_Array_0[2] [L100] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1] [L100] EXPR BOOL_unsigned_char_Array_0[1] [L100] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (127.5f > float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) ((float_Array_0[0] >= float_Array_0[0]) || BOOL_unsigned_char_Array_0[2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((BOOL_unsigned_char_Array_0[0] ? ((signed_char_Array_0[1] > signed_short_int_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[4] == ((signed short int) (signed_short_int_Array_0[3] - (signed_short_int_Array_0[1] - signed_short_int_Array_0[0])))) : (signed_short_int_Array_0[4] == ((signed short int) unsigned_short_int_Array_0[0]))) : (signed_short_int_Array_0[4] == ((signed short int) 8))) : 1) && ((unsigned_short_int_Array_0[0] == signed_short_int_Array_0[3]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + (signed_char_Array_0[0] + -25)))) : ((((32 * -25) | signed_short_int_Array_0[2]) >= signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : 1))) && ((127.5f > float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) ((float_Array_0[0] >= float_Array_0[0]) || BOOL_unsigned_char_Array_0[2])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((BOOL_unsigned_char_Array_0[0] ? ((signed_char_Array_0[1] > signed_short_int_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[4] == ((signed short int) (signed_short_int_Array_0[3] - (signed_short_int_Array_0[1] - signed_short_int_Array_0[0])))) : (signed_short_int_Array_0[4] == ((signed short int) unsigned_short_int_Array_0[0]))) : (signed_short_int_Array_0[4] == ((signed short int) 8))) : 1) && ((unsigned_short_int_Array_0[0] == signed_short_int_Array_0[3]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + (signed_char_Array_0[0] + -25)))) : ((((32 * -25) | signed_short_int_Array_0[2]) >= signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : 1))) && ((127.5f > float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) ((float_Array_0[0] >= float_Array_0[0]) || BOOL_unsigned_char_Array_0[2]))))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((BOOL_unsigned_char_Array_0[0] ? ((signed_char_Array_0[1] > signed_short_int_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[4] == ((signed short int) (signed_short_int_Array_0[3] - (signed_short_int_Array_0[1] - signed_short_int_Array_0[0])))) : (signed_short_int_Array_0[4] == ((signed short int) unsigned_short_int_Array_0[0]))) : (signed_short_int_Array_0[4] == ((signed short int) 8))) : 1) && ((unsigned_short_int_Array_0[0] == signed_short_int_Array_0[3]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + (signed_char_Array_0[0] + -25)))) : ((((32 * -25) | signed_short_int_Array_0[2]) >= signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : 1))) && ((127.5f > float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) ((float_Array_0[0] >= float_Array_0[0]) || BOOL_unsigned_char_Array_0[2]))))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[1])) [L100] EXPR unsigned_short_int_Array_0[0] [L100] EXPR unsigned_short_int_Array_0[1] [L100] EXPR (((BOOL_unsigned_char_Array_0[0] ? ((signed_char_Array_0[1] > signed_short_int_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[4] == ((signed short int) (signed_short_int_Array_0[3] - (signed_short_int_Array_0[1] - signed_short_int_Array_0[0])))) : (signed_short_int_Array_0[4] == ((signed short int) unsigned_short_int_Array_0[0]))) : (signed_short_int_Array_0[4] == ((signed short int) 8))) : 1) && ((unsigned_short_int_Array_0[0] == signed_short_int_Array_0[3]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + (signed_char_Array_0[0] + -25)))) : ((((32 * -25) | signed_short_int_Array_0[2]) >= signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : 1))) && ((127.5f > float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) ((float_Array_0[0] >= float_Array_0[0]) || BOOL_unsigned_char_Array_0[2]))))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((((BOOL_unsigned_char_Array_0[0] ? ((signed_char_Array_0[1] > signed_short_int_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[4] == ((signed short int) (signed_short_int_Array_0[3] - (signed_short_int_Array_0[1] - signed_short_int_Array_0[0])))) : (signed_short_int_Array_0[4] == ((signed short int) unsigned_short_int_Array_0[0]))) : (signed_short_int_Array_0[4] == ((signed short int) 8))) : 1) && ((unsigned_short_int_Array_0[0] == signed_short_int_Array_0[3]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + (signed_char_Array_0[0] + -25)))) : ((((32 * -25) | signed_short_int_Array_0[2]) >= signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : 1))) && ((127.5f > float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) ((float_Array_0[0] >= float_Array_0[0]) || BOOL_unsigned_char_Array_0[2]))))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[1]))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((((BOOL_unsigned_char_Array_0[0] ? ((signed_char_Array_0[1] > signed_short_int_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[4] == ((signed short int) (signed_short_int_Array_0[3] - (signed_short_int_Array_0[1] - signed_short_int_Array_0[0])))) : (signed_short_int_Array_0[4] == ((signed short int) unsigned_short_int_Array_0[0]))) : (signed_short_int_Array_0[4] == ((signed short int) 8))) : 1) && ((unsigned_short_int_Array_0[0] == signed_short_int_Array_0[3]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + (signed_char_Array_0[0] + -25)))) : ((((32 * -25) | signed_short_int_Array_0[2]) >= signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : 1))) && ((127.5f > float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) ((float_Array_0[0] >= float_Array_0[0]) || BOOL_unsigned_char_Array_0[2]))))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[1]))) && (float_Array_0[0] == ((float) float_Array_0[1])) [L100] EXPR float_Array_0[0] [L100] EXPR float_Array_0[1] [L100] EXPR ((((BOOL_unsigned_char_Array_0[0] ? ((signed_char_Array_0[1] > signed_short_int_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[4] == ((signed short int) (signed_short_int_Array_0[3] - (signed_short_int_Array_0[1] - signed_short_int_Array_0[0])))) : (signed_short_int_Array_0[4] == ((signed short int) unsigned_short_int_Array_0[0]))) : (signed_short_int_Array_0[4] == ((signed short int) 8))) : 1) && ((unsigned_short_int_Array_0[0] == signed_short_int_Array_0[3]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + (signed_char_Array_0[0] + -25)))) : ((((32 * -25) | signed_short_int_Array_0[2]) >= signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : 1))) && ((127.5f > float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) ((float_Array_0[0] >= float_Array_0[0]) || BOOL_unsigned_char_Array_0[2]))))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[1]))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((((BOOL_unsigned_char_Array_0[0] ? ((signed_char_Array_0[1] > signed_short_int_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[4] == ((signed short int) (signed_short_int_Array_0[3] - (signed_short_int_Array_0[1] - signed_short_int_Array_0[0])))) : (signed_short_int_Array_0[4] == ((signed short int) unsigned_short_int_Array_0[0]))) : (signed_short_int_Array_0[4] == ((signed short int) 8))) : 1) && ((unsigned_short_int_Array_0[0] == signed_short_int_Array_0[3]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + (signed_char_Array_0[0] + -25)))) : ((((32 * -25) | signed_short_int_Array_0[2]) >= signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : 1))) && ((127.5f > float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) ((float_Array_0[0] >= float_Array_0[0]) || BOOL_unsigned_char_Array_0[2]))))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[1]))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (signed_short_int_Array_0[2] == ((signed short int) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((((BOOL_unsigned_char_Array_0[0] ? ((signed_char_Array_0[1] > signed_short_int_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[4] == ((signed short int) (signed_short_int_Array_0[3] - (signed_short_int_Array_0[1] - signed_short_int_Array_0[0])))) : (signed_short_int_Array_0[4] == ((signed short int) unsigned_short_int_Array_0[0]))) : (signed_short_int_Array_0[4] == ((signed short int) 8))) : 1) && ((unsigned_short_int_Array_0[0] == signed_short_int_Array_0[3]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + (signed_char_Array_0[0] + -25)))) : ((((32 * -25) | signed_short_int_Array_0[2]) >= signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : 1))) && ((127.5f > float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) ((float_Array_0[0] >= float_Array_0[0]) || BOOL_unsigned_char_Array_0[2]))))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[1]))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (signed_short_int_Array_0[2] == ((signed short int) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100-L101] return (((((BOOL_unsigned_char_Array_0[0] ? ((signed_char_Array_0[1] > signed_short_int_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[4] == ((signed short int) (signed_short_int_Array_0[3] - (signed_short_int_Array_0[1] - signed_short_int_Array_0[0])))) : (signed_short_int_Array_0[4] == ((signed short int) unsigned_short_int_Array_0[0]))) : (signed_short_int_Array_0[4] == ((signed short int) 8))) : 1) && ((unsigned_short_int_Array_0[0] == signed_short_int_Array_0[3]) ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + (signed_char_Array_0[0] + -25)))) : ((((32 * -25) | signed_short_int_Array_0[2]) >= signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : 1))) && ((127.5f > float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) ((float_Array_0[0] >= float_Array_0[0]) || BOOL_unsigned_char_Array_0[2]))))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_short_int_Array_0[1]))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (signed_short_int_Array_0[2] == ((signed short int) signed_char_Array_0[0])) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 167 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.3s, OverallIterations: 22, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3472 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3467 mSDsluCounter, 12826 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9596 mSDsCounter, 547 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4582 IncrementalHoareTripleChecker+Invalid, 5129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 547 mSolverCounterUnsat, 3230 mSDtfsCounter, 4582 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1824 GetRequests, 1613 SyntacticMatches, 7 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=608occurred in iteration=21, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 811 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 4135 NumberOfCodeBlocks, 4135 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 4359 ConstructedInterpolants, 0 QuantifiedInterpolants, 14111 SizeOfPredicates, 16 NumberOfNonLiveVariables, 4228 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 33 InterpolantComputations, 18 PerfectInterpolantSequences, 17509/17952 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-03-17 05:30:22,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-97.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 b62f33a7ccb058dd1bccedc0e4fe3fa92f34517f00ef57b41d6990849c30929b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:30:24,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:30:24,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:30:24,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:30:24,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:30:24,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:30:24,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:30:24,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:30:24,584 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:30:24,584 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:30:24,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:30:24,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:30:24,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:30:24,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:30:24,585 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:30:24,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:30:24,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:30:24,585 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:30:24,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:30:24,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:30:24,586 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:30:24,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:30:24,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:30:24,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:30:24,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:30:24,587 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/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 -> b62f33a7ccb058dd1bccedc0e4fe3fa92f34517f00ef57b41d6990849c30929b [2025-03-17 05:30:24,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:30:24,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:30:24,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:30:24,854 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:30:24,855 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:30:24,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-97.i [2025-03-17 05:30:26,015 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db871c9aa/ee5beea436d740598361ae7bc8db67f4/FLAG269a14bf2 [2025-03-17 05:30:26,248 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:30:26,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-97.i [2025-03-17 05:30:26,255 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db871c9aa/ee5beea436d740598361ae7bc8db67f4/FLAG269a14bf2 [2025-03-17 05:30:26,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db871c9aa/ee5beea436d740598361ae7bc8db67f4 [2025-03-17 05:30:26,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:30:26,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:30:26,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:30:26,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:30:26,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:30:26,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:30:26" (1/1) ... [2025-03-17 05:30:26,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@122df84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:26, skipping insertion in model container [2025-03-17 05:30:26,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:30:26" (1/1) ... [2025-03-17 05:30:26,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:30:26,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-97.i[916,929] [2025-03-17 05:30:26,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:30:26,767 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:30:26,774 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-97.i[916,929] [2025-03-17 05:30:26,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:30:26,809 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:30:26,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:26 WrapperNode [2025-03-17 05:30:26,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:30:26,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:30:26,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:30:26,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:30:26,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:26" (1/1) ... [2025-03-17 05:30:26,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:26" (1/1) ... [2025-03-17 05:30:26,844 INFO L138 Inliner]: procedures = 33, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 412 [2025-03-17 05:30:26,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:30:26,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:30:26,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:30:26,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:30:26,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:26" (1/1) ... [2025-03-17 05:30:26,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:26" (1/1) ... [2025-03-17 05:30:26,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:26" (1/1) ... [2025-03-17 05:30:26,885 INFO L175 MemorySlicer]: Split 116 memory accesses to 6 slices as follows [2, 25, 17, 25, 34, 13]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 3, 2, 3, 5, 2]. The 19 writes are split as follows [0, 4, 2, 4, 7, 2]. [2025-03-17 05:30:26,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:26" (1/1) ... [2025-03-17 05:30:26,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:26" (1/1) ... [2025-03-17 05:30:26,913 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:26" (1/1) ... [2025-03-17 05:30:26,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:26" (1/1) ... [2025-03-17 05:30:26,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:26" (1/1) ... [2025-03-17 05:30:26,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:26" (1/1) ... [2025-03-17 05:30:26,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:30:26,927 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:30:26,927 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:30:26,927 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:30:26,928 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:26" (1/1) ... [2025-03-17 05:30:26,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:30:26,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:30:26,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:30:26,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:30:26,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:30:26,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:30:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:30:26,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:30:26,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:30:26,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:30:26,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:30:26,977 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:30:26,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:30:26,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:30:26,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-17 05:30:27,091 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:30:27,092 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:30:27,461 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: havoc property_#t~mem63#1;havoc property_#t~ite76#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite75#1;havoc property_#t~mem66#1;havoc property_#t~ite73#1;havoc property_#t~mem70#1;havoc property_#t~mem69#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~mem74#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite89#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~mem79#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite88#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short90#1;havoc property_#t~mem91#1;havoc property_#t~ite101#1;havoc property_#t~mem95#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~short94#1;havoc property_#t~mem100#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~short99#1;havoc property_#t~short102#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~short105#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short108#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~short111#1; [2025-03-17 05:30:27,493 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2025-03-17 05:30:27,493 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:30:27,512 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:30:27,512 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:30:27,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:30:27 BoogieIcfgContainer [2025-03-17 05:30:27,513 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:30:27,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:30:27,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:30:27,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:30:27,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:30:26" (1/3) ... [2025-03-17 05:30:27,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297b3333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:30:27, skipping insertion in model container [2025-03-17 05:30:27,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:30:26" (2/3) ... [2025-03-17 05:30:27,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297b3333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:30:27, skipping insertion in model container [2025-03-17 05:30:27,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:30:27" (3/3) ... [2025-03-17 05:30:27,520 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-97.i [2025-03-17 05:30:27,529 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:30:27,530 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-97.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:30:27,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:30:27,581 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;@41e0713, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:30:27,582 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:30:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 75 states have internal predecessors, (104), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:27,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:30:27,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:27,594 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:27,594 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:27,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:27,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1475441421, now seen corresponding path program 1 times [2025-03-17 05:30:27,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:27,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802890869] [2025-03-17 05:30:27,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:27,605 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-03-17 05:30:27,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:27,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:27,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:27,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:30:27,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:30:27,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:27,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:27,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:30:27,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-03-17 05:30:27,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:27,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:27,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802890869] [2025-03-17 05:30:27,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802890869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:27,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:27,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:30:27,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185739668] [2025-03-17 05:30:27,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:27,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:30:27,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:27,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:30:27,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:30:27,893 INFO L87 Difference]: Start difference. First operand has 94 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 75 states have internal predecessors, (104), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:30:27,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:27,913 INFO L93 Difference]: Finished difference Result 185 states and 291 transitions. [2025-03-17 05:30:27,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:30:27,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2025-03-17 05:30:27,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:27,921 INFO L225 Difference]: With dead ends: 185 [2025-03-17 05:30:27,921 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 05:30:27,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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-03-17 05:30:27,928 INFO L435 NwaCegarLoop]: 134 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, 134 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-03-17 05:30:27,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:30:27,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 05:30:27,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-17 05:30:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:27,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2025-03-17 05:30:27,970 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 130 [2025-03-17 05:30:27,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:27,970 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2025-03-17 05:30:27,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:30:27,971 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2025-03-17 05:30:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:30:27,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:27,976 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:27,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:28,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:28,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:28,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:28,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1802135100, now seen corresponding path program 1 times [2025-03-17 05:30:28,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:28,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409282129] [2025-03-17 05:30:28,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:28,179 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-03-17 05:30:28,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:28,181 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:28,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:28,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:30:28,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:30:28,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:28,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:28,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:30:28,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:28,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:28,453 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:28,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409282129] [2025-03-17 05:30:28,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409282129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:28,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:28,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:30:28,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568938384] [2025-03-17 05:30:28,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:28,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:30:28,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:28,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:30:28,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:30:28,455 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:28,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:28,495 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2025-03-17 05:30:28,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:30:28,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2025-03-17 05:30:28,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:28,497 INFO L225 Difference]: With dead ends: 185 [2025-03-17 05:30:28,497 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 05:30:28,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 127 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-03-17 05:30:28,498 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 385 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-03-17 05:30:28,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 385 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:30:28,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 05:30:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-17 05:30:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2025-03-17 05:30:28,509 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 130 [2025-03-17 05:30:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:28,510 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2025-03-17 05:30:28,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2025-03-17 05:30:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:30:28,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:28,513 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:28,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:28,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:28,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:28,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:28,715 INFO L85 PathProgramCache]: Analyzing trace with hash 213227894, now seen corresponding path program 1 times [2025-03-17 05:30:28,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:28,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374629593] [2025-03-17 05:30:28,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:28,716 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-03-17 05:30:28,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:28,718 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:28,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:28,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:30:28,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:30:28,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:28,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:28,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:30:28,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:28,980 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:28,980 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:28,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374629593] [2025-03-17 05:30:28,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374629593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:28,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:28,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:30:28,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633490483] [2025-03-17 05:30:28,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:28,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:30:28,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:28,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:30:28,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:30:28,981 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:29,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:29,206 INFO L93 Difference]: Finished difference Result 266 states and 383 transitions. [2025-03-17 05:30:29,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:30:29,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-17 05:30:29,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:29,208 INFO L225 Difference]: With dead ends: 266 [2025-03-17 05:30:29,209 INFO L226 Difference]: Without dead ends: 173 [2025-03-17 05:30:29,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:30:29,210 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 107 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:29,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 620 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:30:29,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-17 05:30:29,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 96. [2025-03-17 05:30:29,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-03-17 05:30:29,223 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 132 [2025-03-17 05:30:29,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:29,224 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-03-17 05:30:29,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:29,224 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-03-17 05:30:29,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:30:29,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:29,227 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:29,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:29,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:29,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:29,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:29,430 INFO L85 PathProgramCache]: Analyzing trace with hash -493231046, now seen corresponding path program 1 times [2025-03-17 05:30:29,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:29,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518493186] [2025-03-17 05:30:29,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:29,431 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-03-17 05:30:29,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:29,433 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:29,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:29,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:30:29,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:30:29,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:29,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:29,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:30:29,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:29,640 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:29,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:29,641 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:29,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518493186] [2025-03-17 05:30:29,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518493186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:29,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:29,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:30:29,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703494854] [2025-03-17 05:30:29,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:29,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:30:29,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:29,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:30:29,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:30:29,643 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:29,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:29,669 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2025-03-17 05:30:29,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:30:29,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-17 05:30:29,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:29,670 INFO L225 Difference]: With dead ends: 194 [2025-03-17 05:30:29,670 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 05:30:29,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 129 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-03-17 05:30:29,671 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 382 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-03-17 05:30:29,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 382 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:30:29,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 05:30:29,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-03-17 05:30:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 79 states have internal predecessors, (106), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2025-03-17 05:30:29,677 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 132 [2025-03-17 05:30:29,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:29,677 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2025-03-17 05:30:29,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:29,677 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2025-03-17 05:30:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:30:29,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:29,687 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:29,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:29,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:29,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:29,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:29,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1994281787, now seen corresponding path program 1 times [2025-03-17 05:30:29,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:29,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60789176] [2025-03-17 05:30:29,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:29,889 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-03-17 05:30:29,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:29,892 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:29,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:29,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:30:30,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:30:30,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:30,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:30,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:30:30,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:30,095 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:30,095 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:30,095 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:30,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60789176] [2025-03-17 05:30:30,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60789176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:30,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:30,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:30:30,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818057088] [2025-03-17 05:30:30,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:30,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:30:30,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:30,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:30:30,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:30:30,096 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:30,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:30,130 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2025-03-17 05:30:30,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:30:30,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-17 05:30:30,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:30,133 INFO L225 Difference]: With dead ends: 198 [2025-03-17 05:30:30,134 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 05:30:30,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 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-03-17 05:30:30,135 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:30,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 501 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:30:30,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 05:30:30,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-03-17 05:30:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 81 states have internal predecessors, (108), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2025-03-17 05:30:30,146 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 132 [2025-03-17 05:30:30,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:30,146 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2025-03-17 05:30:30,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:30,147 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2025-03-17 05:30:30,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:30:30,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:30,148 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:30,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:30,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:30,348 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:30,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:30,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1413181828, now seen corresponding path program 1 times [2025-03-17 05:30:30,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:30,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244269203] [2025-03-17 05:30:30,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:30,349 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-03-17 05:30:30,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:30,353 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:30,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:30,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:30:30,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:30:30,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:30,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:30,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:30:30,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:30,559 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:30,559 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:30,559 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:30,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244269203] [2025-03-17 05:30:30,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244269203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:30,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:30,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:30:30,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725624915] [2025-03-17 05:30:30,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:30,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:30:30,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:30,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:30:30,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:30:30,561 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:30,594 INFO L93 Difference]: Finished difference Result 202 states and 287 transitions. [2025-03-17 05:30:30,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:30:30,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-17 05:30:30,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:30,595 INFO L225 Difference]: With dead ends: 202 [2025-03-17 05:30:30,595 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 05:30:30,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 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-03-17 05:30:30,596 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 620 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.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:30,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 620 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:30:30,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 05:30:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-03-17 05:30:30,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:30,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2025-03-17 05:30:30,601 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 132 [2025-03-17 05:30:30,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:30,601 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2025-03-17 05:30:30,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2025-03-17 05:30:30,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:30:30,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:30,602 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:30,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:30,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:30,803 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:30,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:30,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1412258307, now seen corresponding path program 1 times [2025-03-17 05:30:30,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:30,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890872747] [2025-03-17 05:30:30,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:30,804 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-03-17 05:30:30,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:30,806 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:30,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:30,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:30:31,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:30:31,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:31,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:31,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 05:30:31,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:31,041 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-03-17 05:30:31,169 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 42 treesize of output 20 [2025-03-17 05:30:31,561 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 35 treesize of output 28 [2025-03-17 05:30:31,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:30:31,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2025-03-17 05:30:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 34 proven. 90 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:30:31,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:30:31,954 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-03-17 05:30:31,955 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:31,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890872747] [2025-03-17 05:30:31,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890872747] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:30:31,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:30:31,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2025-03-17 05:30:31,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978881117] [2025-03-17 05:30:31,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:30:31,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 05:30:31,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:31,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 05:30:31,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:30:31,958 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 20 states, 16 states have (on average 5.625) internal successors, (90), 20 states have internal predecessors, (90), 6 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 2 states have call predecessors, (34), 6 states have call successors, (34) [2025-03-17 05:30:32,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:32,901 INFO L93 Difference]: Finished difference Result 324 states and 446 transitions. [2025-03-17 05:30:32,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 05:30:32,902 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 5.625) internal successors, (90), 20 states have internal predecessors, (90), 6 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 2 states have call predecessors, (34), 6 states have call successors, (34) Word has length 132 [2025-03-17 05:30:32,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:32,905 INFO L225 Difference]: With dead ends: 324 [2025-03-17 05:30:32,905 INFO L226 Difference]: Without dead ends: 223 [2025-03-17 05:30:32,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=313, Invalid=1247, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 05:30:32,906 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 252 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:32,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1437 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:30:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-17 05:30:32,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 117. [2025-03-17 05:30:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.3125) internal successors, (126), 96 states have internal predecessors, (126), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 160 transitions. [2025-03-17 05:30:32,933 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 160 transitions. Word has length 132 [2025-03-17 05:30:32,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:32,933 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 160 transitions. [2025-03-17 05:30:32,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 5.625) internal successors, (90), 20 states have internal predecessors, (90), 6 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 2 states have call predecessors, (34), 6 states have call successors, (34) [2025-03-17 05:30:32,933 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 160 transitions. [2025-03-17 05:30:32,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:30:32,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:32,934 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:32,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-17 05:30:33,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:33,135 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:33,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:33,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1479265060, now seen corresponding path program 1 times [2025-03-17 05:30:33,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:33,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653562302] [2025-03-17 05:30:33,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:33,136 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-03-17 05:30:33,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:33,139 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:33,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:33,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:30:33,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:30:33,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:33,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:33,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 05:30:33,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:33,692 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 50 treesize of output 26 [2025-03-17 05:30:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 148 proven. 78 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-17 05:30:33,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:30:33,929 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-03-17 05:30:33,929 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:33,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653562302] [2025-03-17 05:30:33,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653562302] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:30:33,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:30:33,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2025-03-17 05:30:33,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308776498] [2025-03-17 05:30:33,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:30:33,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:30:33,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:33,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:30:33,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:30:33,930 INFO L87 Difference]: Start difference. First operand 117 states and 160 transitions. Second operand has 15 states, 11 states have (on average 7.454545454545454) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 7 states have call successors, (32) [2025-03-17 05:30:34,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:34,321 INFO L93 Difference]: Finished difference Result 255 states and 339 transitions. [2025-03-17 05:30:34,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:30:34,322 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 7.454545454545454) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 7 states have call successors, (32) Word has length 132 [2025-03-17 05:30:34,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:34,323 INFO L225 Difference]: With dead ends: 255 [2025-03-17 05:30:34,323 INFO L226 Difference]: Without dead ends: 139 [2025-03-17 05:30:34,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:30:34,324 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 222 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:34,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 611 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:30:34,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-17 05:30:34,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 124. [2025-03-17 05:30:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 101 states have internal predecessors, (130), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 164 transitions. [2025-03-17 05:30:34,332 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 164 transitions. Word has length 132 [2025-03-17 05:30:34,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:34,332 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 164 transitions. [2025-03-17 05:30:34,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 7.454545454545454) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 7 states have call successors, (32) [2025-03-17 05:30:34,332 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 164 transitions. [2025-03-17 05:30:34,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:30:34,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:34,333 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:34,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:34,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:34,534 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:34,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:34,534 INFO L85 PathProgramCache]: Analyzing trace with hash -715097471, now seen corresponding path program 1 times [2025-03-17 05:30:34,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:34,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885492390] [2025-03-17 05:30:34,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:34,534 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-03-17 05:30:34,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:34,537 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:34,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:34,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:30:34,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:30:34,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:34,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:34,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:30:34,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:35,107 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 35 treesize of output 28 [2025-03-17 05:30:35,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:30:35,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2025-03-17 05:30:35,169 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 148 proven. 78 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-17 05:30:35,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:30:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-03-17 05:30:35,437 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:35,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885492390] [2025-03-17 05:30:35,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885492390] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:30:35,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:30:35,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2025-03-17 05:30:35,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67051423] [2025-03-17 05:30:35,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:30:35,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 05:30:35,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:35,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 05:30:35,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:30:35,439 INFO L87 Difference]: Start difference. First operand 124 states and 164 transitions. Second operand has 20 states, 16 states have (on average 5.5) internal successors, (88), 20 states have internal predecessors, (88), 7 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 7 states have call successors, (32) [2025-03-17 05:30:36,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:36,412 INFO L93 Difference]: Finished difference Result 371 states and 484 transitions. [2025-03-17 05:30:36,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-17 05:30:36,413 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 5.5) internal successors, (88), 20 states have internal predecessors, (88), 7 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 7 states have call successors, (32) Word has length 132 [2025-03-17 05:30:36,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:36,414 INFO L225 Difference]: With dead ends: 371 [2025-03-17 05:30:36,414 INFO L226 Difference]: Without dead ends: 248 [2025-03-17 05:30:36,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=349, Invalid=1373, Unknown=0, NotChecked=0, Total=1722 [2025-03-17 05:30:36,415 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 470 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:36,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1499 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:30:36,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-17 05:30:36,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 116. [2025-03-17 05:30:36,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 93 states have internal predecessors, (118), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:36,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 152 transitions. [2025-03-17 05:30:36,423 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 152 transitions. Word has length 132 [2025-03-17 05:30:36,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:36,423 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 152 transitions. [2025-03-17 05:30:36,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 5.5) internal successors, (88), 20 states have internal predecessors, (88), 7 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 7 states have call successors, (32) [2025-03-17 05:30:36,423 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 152 transitions. [2025-03-17 05:30:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 05:30:36,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:36,425 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:36,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-17 05:30:36,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:36,626 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:36,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:36,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1371398691, now seen corresponding path program 1 times [2025-03-17 05:30:36,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:36,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950834496] [2025-03-17 05:30:36,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:36,627 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-03-17 05:30:36,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:36,628 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:36,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:36,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:30:36,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:30:36,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:36,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:36,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 05:30:36,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:36,797 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-03-17 05:30:36,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2025-03-17 05:30:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:36,831 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:36,831 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:36,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950834496] [2025-03-17 05:30:36,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950834496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:36,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:36,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:30:36,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238955868] [2025-03-17 05:30:36,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:36,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:30:36,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:36,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:30:36,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:30:36,832 INFO L87 Difference]: Start difference. First operand 116 states and 152 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:37,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:37,016 INFO L93 Difference]: Finished difference Result 349 states and 458 transitions. [2025-03-17 05:30:37,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:30:37,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2025-03-17 05:30:37,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:37,018 INFO L225 Difference]: With dead ends: 349 [2025-03-17 05:30:37,018 INFO L226 Difference]: Without dead ends: 234 [2025-03-17 05:30:37,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:30:37,019 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 125 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:37,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 871 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:30:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-17 05:30:37,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 120. [2025-03-17 05:30:37,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.2783505154639174) internal successors, (124), 97 states have internal predecessors, (124), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 158 transitions. [2025-03-17 05:30:37,032 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 158 transitions. Word has length 133 [2025-03-17 05:30:37,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:37,032 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 158 transitions. [2025-03-17 05:30:37,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:37,032 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 158 transitions. [2025-03-17 05:30:37,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 05:30:37,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:37,033 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:37,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:37,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:37,234 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:37,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:37,235 INFO L85 PathProgramCache]: Analyzing trace with hash 664939751, now seen corresponding path program 1 times [2025-03-17 05:30:37,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:37,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734992942] [2025-03-17 05:30:37,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:37,235 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-03-17 05:30:37,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:37,237 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:37,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:37,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:30:37,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:30:37,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:37,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:37,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:30:37,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:37,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 05:30:37,546 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:37,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:37,546 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:37,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734992942] [2025-03-17 05:30:37,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734992942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:37,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:37,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:30:37,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241833238] [2025-03-17 05:30:37,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:37,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:30:37,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:37,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:30:37,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:30:37,548 INFO L87 Difference]: Start difference. First operand 120 states and 158 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:37,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:37,731 INFO L93 Difference]: Finished difference Result 239 states and 315 transitions. [2025-03-17 05:30:37,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:30:37,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2025-03-17 05:30:37,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:37,733 INFO L225 Difference]: With dead ends: 239 [2025-03-17 05:30:37,733 INFO L226 Difference]: Without dead ends: 120 [2025-03-17 05:30:37,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:30:37,733 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 116 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:37,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 302 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:30:37,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-17 05:30:37,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-17 05:30:37,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.2577319587628866) internal successors, (122), 97 states have internal predecessors, (122), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:37,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 156 transitions. [2025-03-17 05:30:37,740 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 156 transitions. Word has length 133 [2025-03-17 05:30:37,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:37,741 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 156 transitions. [2025-03-17 05:30:37,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:37,741 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 156 transitions. [2025-03-17 05:30:37,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 05:30:37,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:37,742 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:37,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:37,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:37,942 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:37,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:37,943 INFO L85 PathProgramCache]: Analyzing trace with hash -421522634, now seen corresponding path program 1 times [2025-03-17 05:30:37,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:37,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9453728] [2025-03-17 05:30:37,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:37,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-03-17 05:30:37,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:37,945 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:37,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:38,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 05:30:38,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 05:30:38,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:38,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:38,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 05:30:38,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:38,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:30:38,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2025-03-17 05:30:38,686 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 16 [2025-03-17 05:30:38,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:30:38,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 61 [2025-03-17 05:30:39,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:30:39,004 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 79 treesize of output 81 [2025-03-17 05:30:39,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:30:39,156 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 97 treesize of output 57 [2025-03-17 05:30:39,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:30:39,163 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 85 treesize of output 45 [2025-03-17 05:30:39,210 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 259 proven. 60 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-17 05:30:39,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:30:39,355 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:39,355 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:39,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9453728] [2025-03-17 05:30:39,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9453728] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:30:39,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:30:39,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 20 [2025-03-17 05:30:39,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143163588] [2025-03-17 05:30:39,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:39,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:30:39,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:39,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:30:39,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:30:39,356 INFO L87 Difference]: Start difference. First operand 120 states and 156 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:39,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:39,582 INFO L93 Difference]: Finished difference Result 336 states and 435 transitions. [2025-03-17 05:30:39,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:30:39,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-03-17 05:30:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:39,584 INFO L225 Difference]: With dead ends: 336 [2025-03-17 05:30:39,584 INFO L226 Difference]: Without dead ends: 217 [2025-03-17 05:30:39,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:30:39,585 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 170 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:39,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 523 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:30:39,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-17 05:30:39,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 120. [2025-03-17 05:30:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.2474226804123711) internal successors, (121), 97 states have internal predecessors, (121), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:39,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 155 transitions. [2025-03-17 05:30:39,597 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 155 transitions. Word has length 134 [2025-03-17 05:30:39,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:39,597 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 155 transitions. [2025-03-17 05:30:39,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:39,598 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 155 transitions. [2025-03-17 05:30:39,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:30:39,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:39,598 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:39,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:39,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:39,799 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:39,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:39,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1100522299, now seen corresponding path program 1 times [2025-03-17 05:30:39,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:39,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652436549] [2025-03-17 05:30:39,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:39,800 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-03-17 05:30:39,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:39,802 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:39,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:39,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:30:40,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:30:40,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:40,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:40,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 05:30:40,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:40,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:30:40,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2025-03-17 05:30:40,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:30:40,456 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 49 treesize of output 31 [2025-03-17 05:30:40,458 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 16 treesize of output 12 [2025-03-17 05:30:40,562 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 47 treesize of output 40 [2025-03-17 05:30:40,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:30:40,624 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 33 treesize of output 15 [2025-03-17 05:30:40,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-03-17 05:30:41,669 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 259 proven. 60 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-17 05:30:41,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:30:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:42,027 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:42,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652436549] [2025-03-17 05:30:42,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652436549] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:30:42,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:30:42,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2025-03-17 05:30:42,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956989846] [2025-03-17 05:30:42,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:42,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:30:42,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:42,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:30:42,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:30:42,028 INFO L87 Difference]: Start difference. First operand 120 states and 155 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:42,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:42,322 INFO L93 Difference]: Finished difference Result 331 states and 426 transitions. [2025-03-17 05:30:42,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:30:42,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-03-17 05:30:42,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:42,323 INFO L225 Difference]: With dead ends: 331 [2025-03-17 05:30:42,324 INFO L226 Difference]: Without dead ends: 212 [2025-03-17 05:30:42,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:30:42,324 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 162 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:42,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 318 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:30:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-17 05:30:42,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 120. [2025-03-17 05:30:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.2371134020618557) internal successors, (120), 97 states have internal predecessors, (120), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:30:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 154 transitions. [2025-03-17 05:30:42,333 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 154 transitions. Word has length 135 [2025-03-17 05:30:42,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:42,333 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 154 transitions. [2025-03-17 05:30:42,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 154 transitions. [2025-03-17 05:30:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:30:42,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:42,334 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:42,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-03-17 05:30:42,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:42,535 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:42,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:42,535 INFO L85 PathProgramCache]: Analyzing trace with hash -316184799, now seen corresponding path program 1 times [2025-03-17 05:30:42,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:42,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125795021] [2025-03-17 05:30:42,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:42,535 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-03-17 05:30:42,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:42,537 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:42,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:42,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:30:42,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:30:42,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:42,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:42,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 05:30:42,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:42,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-17 05:30:42,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2025-03-17 05:30:43,644 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 16 [2025-03-17 05:30:43,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:30:43,752 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 97 treesize of output 71 [2025-03-17 05:30:43,869 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 24 treesize of output 12 [2025-03-17 05:30:44,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:30:44,158 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 144 treesize of output 78 [2025-03-17 05:30:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 296 proven. 96 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-03-17 05:30:44,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:30:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:44,618 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:44,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125795021] [2025-03-17 05:30:44,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125795021] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:30:44,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:30:44,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [26] total 30 [2025-03-17 05:30:44,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277792601] [2025-03-17 05:30:44,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:44,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:30:44,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:44,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:30:44,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2025-03-17 05:30:44,619 INFO L87 Difference]: Start difference. First operand 120 states and 154 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:44,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:44,837 INFO L93 Difference]: Finished difference Result 328 states and 414 transitions. [2025-03-17 05:30:44,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:30:44,837 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-03-17 05:30:44,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:44,838 INFO L225 Difference]: With dead ends: 328 [2025-03-17 05:30:44,838 INFO L226 Difference]: Without dead ends: 209 [2025-03-17 05:30:44,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 05:30:44,839 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 203 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:44,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 835 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:30:44,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-17 05:30:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2025-03-17 05:30:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 173 states have (on average 1.2369942196531791) internal successors, (214), 174 states have internal predecessors, (214), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:30:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 258 transitions. [2025-03-17 05:30:44,856 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 258 transitions. Word has length 135 [2025-03-17 05:30:44,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:44,857 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 258 transitions. [2025-03-17 05:30:44,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 258 transitions. [2025-03-17 05:30:44,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:30:44,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:44,858 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:44,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:45,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:45,058 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:45,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:45,059 INFO L85 PathProgramCache]: Analyzing trace with hash 179598103, now seen corresponding path program 1 times [2025-03-17 05:30:45,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:45,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819078854] [2025-03-17 05:30:45,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:45,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-03-17 05:30:45,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:45,062 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:45,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:45,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:30:45,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:30:45,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:45,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:45,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 05:30:45,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:45,280 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-03-17 05:30:45,281 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 20 treesize of output 16 [2025-03-17 05:30:45,283 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 16 treesize of output 12 [2025-03-17 05:30:45,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:30:45,337 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 47 [2025-03-17 05:30:45,398 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 19 [2025-03-17 05:30:45,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:30:45,401 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 47 treesize of output 23 [2025-03-17 05:30:45,427 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:45,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:45,428 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:45,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819078854] [2025-03-17 05:30:45,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819078854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:45,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:45,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:30:45,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769308446] [2025-03-17 05:30:45,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:45,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:30:45,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:45,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:30:45,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:30:45,429 INFO L87 Difference]: Start difference. First operand 206 states and 258 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:47,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:30:49,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:30:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:50,985 INFO L93 Difference]: Finished difference Result 578 states and 724 transitions. [2025-03-17 05:30:50,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:30:50,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-03-17 05:30:50,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:50,987 INFO L225 Difference]: With dead ends: 578 [2025-03-17 05:30:50,987 INFO L226 Difference]: Without dead ends: 373 [2025-03-17 05:30:50,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:30:50,988 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 298 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:50,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1190 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 418 Invalid, 2 Unknown, 0 Unchecked, 5.5s Time] [2025-03-17 05:30:50,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-17 05:30:51,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 285. [2025-03-17 05:30:51,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 221 states have (on average 1.1945701357466063) internal successors, (264), 223 states have internal predecessors, (264), 47 states have call successors, (47), 16 states have call predecessors, (47), 16 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-17 05:30:51,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 358 transitions. [2025-03-17 05:30:51,016 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 358 transitions. Word has length 136 [2025-03-17 05:30:51,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:51,016 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 358 transitions. [2025-03-17 05:30:51,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 358 transitions. [2025-03-17 05:30:51,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:30:51,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:51,017 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:51,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:51,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:51,222 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:51,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:51,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1816029928, now seen corresponding path program 1 times [2025-03-17 05:30:51,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:51,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241089053] [2025-03-17 05:30:51,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:51,223 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-03-17 05:30:51,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:51,225 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:51,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:51,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:30:51,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:30:51,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:51,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:51,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 05:30:51,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:51,478 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-03-17 05:30:51,480 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-03-17 05:30:51,513 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-03-17 05:30:51,608 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 20 treesize of output 16 [2025-03-17 05:30:51,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:30:51,611 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 37 treesize of output 39 [2025-03-17 05:30:51,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:30:51,680 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 76 treesize of output 72 [2025-03-17 05:30:51,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:30:51,775 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 159 treesize of output 81 [2025-03-17 05:30:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-17 05:30:51,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:51,820 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:51,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241089053] [2025-03-17 05:30:51,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241089053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:51,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:51,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:30:51,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728473426] [2025-03-17 05:30:51,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:51,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:30:51,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:51,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:30:51,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:30:51,821 INFO L87 Difference]: Start difference. First operand 285 states and 358 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:30:52,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:52,724 INFO L93 Difference]: Finished difference Result 692 states and 862 transitions. [2025-03-17 05:30:52,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:30:52,725 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 136 [2025-03-17 05:30:52,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:52,728 INFO L225 Difference]: With dead ends: 692 [2025-03-17 05:30:52,728 INFO L226 Difference]: Without dead ends: 467 [2025-03-17 05:30:52,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:30:52,729 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 357 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:52,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1013 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:30:52,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-17 05:30:52,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 462. [2025-03-17 05:30:52,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 369 states have (on average 1.2005420054200542) internal successors, (443), 373 states have internal predecessors, (443), 65 states have call successors, (65), 27 states have call predecessors, (65), 27 states have return successors, (65), 61 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:30:52,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 573 transitions. [2025-03-17 05:30:52,788 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 573 transitions. Word has length 136 [2025-03-17 05:30:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:52,789 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 573 transitions. [2025-03-17 05:30:52,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:30:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 573 transitions. [2025-03-17 05:30:52,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:30:52,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:52,790 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:52,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:52,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:52,991 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:52,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:52,991 INFO L85 PathProgramCache]: Analyzing trace with hash -462720231, now seen corresponding path program 1 times [2025-03-17 05:30:52,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:52,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879669156] [2025-03-17 05:30:52,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:52,992 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-03-17 05:30:52,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:52,993 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:52,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:53,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:30:53,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:30:53,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:53,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:53,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:30:53,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:53,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 05:30:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:53,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:53,253 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:53,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879669156] [2025-03-17 05:30:53,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879669156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:53,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:53,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:30:53,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319550829] [2025-03-17 05:30:53,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:53,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:30:53,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:53,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:30:53,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:30:53,254 INFO L87 Difference]: Start difference. First operand 462 states and 573 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:53,810 INFO L93 Difference]: Finished difference Result 856 states and 1061 transitions. [2025-03-17 05:30:53,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:30:53,810 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-03-17 05:30:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:53,812 INFO L225 Difference]: With dead ends: 856 [2025-03-17 05:30:53,812 INFO L226 Difference]: Without dead ends: 454 [2025-03-17 05:30:53,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:30:53,813 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 112 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:53,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 299 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:30:53,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-17 05:30:53,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2025-03-17 05:30:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 361 states have (on average 1.188365650969529) internal successors, (429), 365 states have internal predecessors, (429), 65 states have call successors, (65), 27 states have call predecessors, (65), 27 states have return successors, (65), 61 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:30:53,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 559 transitions. [2025-03-17 05:30:53,870 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 559 transitions. Word has length 136 [2025-03-17 05:30:53,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:53,871 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 559 transitions. [2025-03-17 05:30:53,871 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:53,871 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 559 transitions. [2025-03-17 05:30:53,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:30:53,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:53,872 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:53,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:54,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:54,073 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:54,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:54,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1604679015, now seen corresponding path program 1 times [2025-03-17 05:30:54,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:54,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983754533] [2025-03-17 05:30:54,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:54,074 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-03-17 05:30:54,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:54,075 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:54,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:54,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:30:54,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:30:54,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:54,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:54,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:30:54,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:54,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 05:30:54,263 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:54,263 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:54,263 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:54,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983754533] [2025-03-17 05:30:54,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983754533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:54,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:54,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:30:54,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282139840] [2025-03-17 05:30:54,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:54,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:30:54,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:54,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:30:54,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:30:54,265 INFO L87 Difference]: Start difference. First operand 454 states and 559 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:55,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:55,086 INFO L93 Difference]: Finished difference Result 832 states and 1025 transitions. [2025-03-17 05:30:55,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:30:55,087 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-03-17 05:30:55,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:55,089 INFO L225 Difference]: With dead ends: 832 [2025-03-17 05:30:55,089 INFO L226 Difference]: Without dead ends: 438 [2025-03-17 05:30:55,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:30:55,090 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 114 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:55,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 294 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:30:55,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-17 05:30:55,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-03-17 05:30:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 345 states have (on average 1.1855072463768115) internal successors, (409), 349 states have internal predecessors, (409), 65 states have call successors, (65), 27 states have call predecessors, (65), 27 states have return successors, (65), 61 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:30:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 539 transitions. [2025-03-17 05:30:55,137 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 539 transitions. Word has length 136 [2025-03-17 05:30:55,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:55,137 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 539 transitions. [2025-03-17 05:30:55,137 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 539 transitions. [2025-03-17 05:30:55,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:30:55,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:55,138 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:55,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2025-03-17 05:30:55,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:55,339 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:55,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:55,339 INFO L85 PathProgramCache]: Analyzing trace with hash 804901215, now seen corresponding path program 1 times [2025-03-17 05:30:55,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:55,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713743045] [2025-03-17 05:30:55,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:55,340 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-03-17 05:30:55,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:55,341 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:55,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2025-03-17 05:30:55,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:30:55,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:30:55,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:55,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:55,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:30:55,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:55,525 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:55,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:30:55,525 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:55,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713743045] [2025-03-17 05:30:55,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713743045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:30:55,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:30:55,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:30:55,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815785075] [2025-03-17 05:30:55,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:55,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:30:55,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:55,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:30:55,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:30:55,526 INFO L87 Difference]: Start difference. First operand 438 states and 539 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:55,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:55,593 INFO L93 Difference]: Finished difference Result 832 states and 1023 transitions. [2025-03-17 05:30:55,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:30:55,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2025-03-17 05:30:55,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:55,596 INFO L225 Difference]: With dead ends: 832 [2025-03-17 05:30:55,596 INFO L226 Difference]: Without dead ends: 454 [2025-03-17 05:30:55,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 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-03-17 05:30:55,597 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:55,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 610 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:30:55,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-17 05:30:55,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 448. [2025-03-17 05:30:55,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 355 states have (on average 1.180281690140845) internal successors, (419), 359 states have internal predecessors, (419), 65 states have call successors, (65), 27 states have call predecessors, (65), 27 states have return successors, (65), 61 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:30:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 549 transitions. [2025-03-17 05:30:55,646 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 549 transitions. Word has length 137 [2025-03-17 05:30:55,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:55,646 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 549 transitions. [2025-03-17 05:30:55,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 549 transitions. [2025-03-17 05:30:55,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:30:55,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:55,647 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:55,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2025-03-17 05:30:55,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:55,848 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:55,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:55,848 INFO L85 PathProgramCache]: Analyzing trace with hash 370359738, now seen corresponding path program 1 times [2025-03-17 05:30:55,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:55,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142926383] [2025-03-17 05:30:55,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:55,849 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-03-17 05:30:55,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:55,850 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:55,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2025-03-17 05:30:55,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:30:56,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:30:56,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:56,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:56,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 05:30:56,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:56,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-17 05:30:56,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2025-03-17 05:30:56,670 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 16 [2025-03-17 05:30:56,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:30:56,773 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 85 treesize of output 65 [2025-03-17 05:30:56,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2025-03-17 05:30:57,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:30:57,344 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 70 treesize of output 46 [2025-03-17 05:30:57,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:30:57,351 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 110 treesize of output 60 [2025-03-17 05:30:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 264 proven. 60 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:30:57,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:30:57,563 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:30:57,563 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:57,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142926383] [2025-03-17 05:30:57,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142926383] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:30:57,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:30:57,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 21 [2025-03-17 05:30:57,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706561644] [2025-03-17 05:30:57,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:30:57,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:30:57,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:30:57,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:30:57,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:30:57,564 INFO L87 Difference]: Start difference. First operand 448 states and 549 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:57,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:30:57,756 INFO L93 Difference]: Finished difference Result 470 states and 572 transitions. [2025-03-17 05:30:57,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:30:57,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-17 05:30:57,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:30:57,759 INFO L225 Difference]: With dead ends: 470 [2025-03-17 05:30:57,759 INFO L226 Difference]: Without dead ends: 468 [2025-03-17 05:30:57,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:30:57,759 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 64 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:30:57,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 590 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:30:57,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-17 05:30:57,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-03-17 05:30:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 373 states have (on average 1.1715817694369972) internal successors, (437), 377 states have internal predecessors, (437), 65 states have call successors, (65), 29 states have call predecessors, (65), 29 states have return successors, (65), 61 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 05:30:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 567 transitions. [2025-03-17 05:30:57,805 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 567 transitions. Word has length 139 [2025-03-17 05:30:57,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:30:57,805 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 567 transitions. [2025-03-17 05:30:57,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:30:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 567 transitions. [2025-03-17 05:30:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:30:57,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:30:57,806 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:30:57,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2025-03-17 05:30:58,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:58,007 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:30:58,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:30:58,008 INFO L85 PathProgramCache]: Analyzing trace with hash 371283259, now seen corresponding path program 1 times [2025-03-17 05:30:58,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:30:58,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116040179] [2025-03-17 05:30:58,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:58,008 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-03-17 05:30:58,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:30:58,010 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:30:58,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2025-03-17 05:30:58,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:30:58,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:30:58,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:58,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:58,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:30:58,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:58,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 05:30:58,675 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 121 treesize of output 61 [2025-03-17 05:30:58,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:30:58,847 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 203 treesize of output 77 [2025-03-17 05:30:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 05:30:58,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:30:58,993 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:30:58,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116040179] [2025-03-17 05:30:58,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2116040179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:30:58,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1641539948] [2025-03-17 05:30:58,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:30:58,994 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:30:58,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:30:58,998 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:30:58,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2025-03-17 05:30:59,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:30:59,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:30:59,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:30:59,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:30:59,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 05:30:59,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:30:59,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:31:00,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2025-03-17 05:31:00,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:31:00,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 77 [2025-03-17 05:31:00,871 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 05:31:00,871 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:31:00,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1641539948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:31:00,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:31:00,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 16 [2025-03-17 05:31:00,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815818321] [2025-03-17 05:31:00,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:31:00,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:31:00,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:31:00,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:31:00,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:31:00,873 INFO L87 Difference]: Start difference. First operand 468 states and 567 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:31:01,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:01,507 INFO L93 Difference]: Finished difference Result 1301 states and 1572 transitions. [2025-03-17 05:31:01,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:31:01,508 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-03-17 05:31:01,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:01,511 INFO L225 Difference]: With dead ends: 1301 [2025-03-17 05:31:01,511 INFO L226 Difference]: Without dead ends: 893 [2025-03-17 05:31:01,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:31:01,513 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 220 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:01,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 877 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:31:01,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2025-03-17 05:31:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 739. [2025-03-17 05:31:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 590 states have (on average 1.1830508474576271) internal successors, (698), 598 states have internal predecessors, (698), 110 states have call successors, (110), 38 states have call predecessors, (110), 38 states have return successors, (110), 102 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-17 05:31:01,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 918 transitions. [2025-03-17 05:31:01,602 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 918 transitions. Word has length 139 [2025-03-17 05:31:01,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:01,602 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 918 transitions. [2025-03-17 05:31:01,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:31:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 918 transitions. [2025-03-17 05:31:01,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:31:01,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:01,604 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:31:01,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2025-03-17 05:31:01,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2025-03-17 05:31:02,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:02,005 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:02,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:02,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1258786940, now seen corresponding path program 1 times [2025-03-17 05:31:02,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:31:02,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827965972] [2025-03-17 05:31:02,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:02,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:31:02,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:31:02,007 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:02,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2025-03-17 05:31:02,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:31:02,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:31:02,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:02,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:02,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 05:31:02,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:31:02,270 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-03-17 05:31:02,272 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 19 treesize of output 19 [2025-03-17 05:31:02,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:31:02,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 33 [2025-03-17 05:31:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:31:02,376 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:31:02,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:31:02,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827965972] [2025-03-17 05:31:02,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827965972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:31:02,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:31:02,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:31:02,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069664129] [2025-03-17 05:31:02,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:31:02,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:31:02,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:31:02,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:31:02,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:31:02,377 INFO L87 Difference]: Start difference. First operand 739 states and 918 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:02,670 INFO L93 Difference]: Finished difference Result 1415 states and 1744 transitions. [2025-03-17 05:31:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:31:02,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-17 05:31:02,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:02,674 INFO L225 Difference]: With dead ends: 1415 [2025-03-17 05:31:02,674 INFO L226 Difference]: Without dead ends: 767 [2025-03-17 05:31:02,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:31:02,678 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 261 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:02,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 759 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:31:02,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2025-03-17 05:31:02,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 763. [2025-03-17 05:31:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 606 states have (on average 1.165016501650165) internal successors, (706), 614 states have internal predecessors, (706), 114 states have call successors, (114), 42 states have call predecessors, (114), 42 states have return successors, (114), 106 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-17 05:31:02,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 934 transitions. [2025-03-17 05:31:02,770 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 934 transitions. Word has length 139 [2025-03-17 05:31:02,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:02,770 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 934 transitions. [2025-03-17 05:31:02,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:02,770 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 934 transitions. [2025-03-17 05:31:02,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:31:02,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:02,771 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:31:02,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2025-03-17 05:31:02,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:02,972 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:02,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:02,973 INFO L85 PathProgramCache]: Analyzing trace with hash -548667523, now seen corresponding path program 1 times [2025-03-17 05:31:02,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:31:02,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276153509] [2025-03-17 05:31:02,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:02,973 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-03-17 05:31:02,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:31:02,975 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:02,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2025-03-17 05:31:03,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:31:03,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:31:03,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:03,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:03,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 05:31:03,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:31:03,228 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-03-17 05:31:03,314 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 37 treesize of output 30 [2025-03-17 05:31:03,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:31:03,786 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-03-17 05:31:03,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:31:03,967 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 76 treesize of output 38 [2025-03-17 05:31:04,019 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 34 proven. 90 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:31:04,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:31:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:31:04,311 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:31:04,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276153509] [2025-03-17 05:31:04,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276153509] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:31:04,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:31:04,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 23 [2025-03-17 05:31:04,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772791479] [2025-03-17 05:31:04,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:31:04,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:31:04,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:31:04,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:31:04,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:31:04,312 INFO L87 Difference]: Start difference. First operand 763 states and 934 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:04,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:04,641 INFO L93 Difference]: Finished difference Result 1661 states and 2025 transitions. [2025-03-17 05:31:04,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:31:04,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-17 05:31:04,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:04,646 INFO L225 Difference]: With dead ends: 1661 [2025-03-17 05:31:04,646 INFO L226 Difference]: Without dead ends: 989 [2025-03-17 05:31:04,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2025-03-17 05:31:04,648 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 48 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:04,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 858 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:31:04,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-03-17 05:31:04,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 891. [2025-03-17 05:31:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 734 states have (on average 1.173024523160763) internal successors, (861), 742 states have internal predecessors, (861), 114 states have call successors, (114), 42 states have call predecessors, (114), 42 states have return successors, (114), 106 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-17 05:31:04,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1089 transitions. [2025-03-17 05:31:04,738 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1089 transitions. Word has length 139 [2025-03-17 05:31:04,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:04,738 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1089 transitions. [2025-03-17 05:31:04,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:04,738 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1089 transitions. [2025-03-17 05:31:04,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:31:04,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:04,739 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:31:04,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2025-03-17 05:31:04,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:04,940 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:04,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:04,940 INFO L85 PathProgramCache]: Analyzing trace with hash -842070530, now seen corresponding path program 1 times [2025-03-17 05:31:04,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:31:04,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109768357] [2025-03-17 05:31:04,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:04,941 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-03-17 05:31:04,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:31:04,942 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:04,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2025-03-17 05:31:05,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:31:05,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:31:05,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:05,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:05,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:31:05,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:31:05,191 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-03-17 05:31:05,681 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 48 treesize of output 24 [2025-03-17 05:31:05,767 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 60 treesize of output 30 [2025-03-17 05:31:05,778 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 150 proven. 78 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-03-17 05:31:05,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:31:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-03-17 05:31:05,968 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:31:05,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109768357] [2025-03-17 05:31:05,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109768357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:31:05,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:31:05,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2025-03-17 05:31:05,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112171659] [2025-03-17 05:31:05,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:31:05,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:31:05,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:31:05,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:31:05,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:31:05,970 INFO L87 Difference]: Start difference. First operand 891 states and 1089 transitions. Second operand has 17 states, 13 states have (on average 8.23076923076923) internal successors, (107), 15 states have internal predecessors, (107), 7 states have call successors, (32), 4 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 7 states have call successors, (32) [2025-03-17 05:31:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:06,505 INFO L93 Difference]: Finished difference Result 1695 states and 2063 transitions. [2025-03-17 05:31:06,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:31:06,506 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 8.23076923076923) internal successors, (107), 15 states have internal predecessors, (107), 7 states have call successors, (32), 4 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 7 states have call successors, (32) Word has length 139 [2025-03-17 05:31:06,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:06,509 INFO L225 Difference]: With dead ends: 1695 [2025-03-17 05:31:06,509 INFO L226 Difference]: Without dead ends: 895 [2025-03-17 05:31:06,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:31:06,510 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 107 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:06,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 489 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:31:06,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-03-17 05:31:06,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 887. [2025-03-17 05:31:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 730 states have (on average 1.1575342465753424) internal successors, (845), 738 states have internal predecessors, (845), 114 states have call successors, (114), 42 states have call predecessors, (114), 42 states have return successors, (114), 106 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-17 05:31:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1073 transitions. [2025-03-17 05:31:06,613 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1073 transitions. Word has length 139 [2025-03-17 05:31:06,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:06,614 INFO L471 AbstractCegarLoop]: Abstraction has 887 states and 1073 transitions. [2025-03-17 05:31:06,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 8.23076923076923) internal successors, (107), 15 states have internal predecessors, (107), 7 states have call successors, (32), 4 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 7 states have call successors, (32) [2025-03-17 05:31:06,614 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1073 transitions. [2025-03-17 05:31:06,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:31:06,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:06,616 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:31:06,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2025-03-17 05:31:06,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:06,816 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:06,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:06,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1066784121, now seen corresponding path program 1 times [2025-03-17 05:31:06,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:31:06,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199469053] [2025-03-17 05:31:06,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:06,817 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-03-17 05:31:06,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:31:06,819 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:06,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2025-03-17 05:31:06,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:31:07,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:31:07,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:07,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:07,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:31:07,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:31:07,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 61 [2025-03-17 05:31:07,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:31:07,944 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 127 treesize of output 49 [2025-03-17 05:31:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 05:31:07,985 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:31:07,985 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:31:07,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199469053] [2025-03-17 05:31:07,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199469053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:31:07,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:31:07,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:31:07,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581855329] [2025-03-17 05:31:07,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:31:07,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:31:07,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:31:07,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:31:07,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:31:07,986 INFO L87 Difference]: Start difference. First operand 887 states and 1073 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:31:08,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:08,645 INFO L93 Difference]: Finished difference Result 1817 states and 2156 transitions. [2025-03-17 05:31:08,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:31:08,646 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-03-17 05:31:08,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:08,649 INFO L225 Difference]: With dead ends: 1817 [2025-03-17 05:31:08,649 INFO L226 Difference]: Without dead ends: 1021 [2025-03-17 05:31:08,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:31:08,651 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 202 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:08,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 686 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:31:08,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-03-17 05:31:08,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 867. [2025-03-17 05:31:08,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 710 states have (on average 1.1450704225352113) internal successors, (813), 718 states have internal predecessors, (813), 114 states have call successors, (114), 42 states have call predecessors, (114), 42 states have return successors, (114), 106 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-17 05:31:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1041 transitions. [2025-03-17 05:31:08,750 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1041 transitions. Word has length 139 [2025-03-17 05:31:08,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:08,750 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1041 transitions. [2025-03-17 05:31:08,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:31:08,750 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1041 transitions. [2025-03-17 05:31:08,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:31:08,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:08,751 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:31:08,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2025-03-17 05:31:08,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:08,951 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:08,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:08,952 INFO L85 PathProgramCache]: Analyzing trace with hash -404109379, now seen corresponding path program 1 times [2025-03-17 05:31:08,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:31:08,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679334990] [2025-03-17 05:31:08,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:08,952 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-03-17 05:31:08,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:31:08,954 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:08,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2025-03-17 05:31:09,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:31:09,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:31:09,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:09,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:09,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:31:09,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:31:09,220 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-03-17 05:31:09,221 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 20 treesize of output 16 [2025-03-17 05:31:09,222 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 16 treesize of output 12 [2025-03-17 05:31:09,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:31:09,281 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 44 treesize of output 46 [2025-03-17 05:31:09,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2025-03-17 05:31:09,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:31:09,352 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 46 treesize of output 22 [2025-03-17 05:31:09,371 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:31:09,371 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:31:09,371 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:31:09,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679334990] [2025-03-17 05:31:09,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679334990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:31:09,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:31:09,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:31:09,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508108893] [2025-03-17 05:31:09,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:31:09,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:31:09,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:31:09,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:31:09,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:31:09,372 INFO L87 Difference]: Start difference. First operand 867 states and 1041 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:10,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:10,136 INFO L93 Difference]: Finished difference Result 1631 states and 1935 transitions. [2025-03-17 05:31:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:31:10,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-17 05:31:10,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:10,140 INFO L225 Difference]: With dead ends: 1631 [2025-03-17 05:31:10,140 INFO L226 Difference]: Without dead ends: 855 [2025-03-17 05:31:10,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:31:10,141 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 274 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:10,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 835 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:31:10,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-03-17 05:31:10,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 701. [2025-03-17 05:31:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 568 states have (on average 1.1214788732394365) internal successors, (637), 574 states have internal predecessors, (637), 96 states have call successors, (96), 36 states have call predecessors, (96), 36 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 05:31:10,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 829 transitions. [2025-03-17 05:31:10,236 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 829 transitions. Word has length 139 [2025-03-17 05:31:10,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:10,236 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 829 transitions. [2025-03-17 05:31:10,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:10,236 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 829 transitions. [2025-03-17 05:31:10,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:31:10,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:10,238 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:31:10,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2025-03-17 05:31:10,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:10,438 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:10,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:10,439 INFO L85 PathProgramCache]: Analyzing trace with hash -912627908, now seen corresponding path program 1 times [2025-03-17 05:31:10,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:31:10,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366022228] [2025-03-17 05:31:10,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:10,439 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-03-17 05:31:10,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:31:10,441 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:10,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2025-03-17 05:31:10,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:31:10,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:31:10,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:10,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:10,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:31:10,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:31:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 05:31:10,625 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:31:10,625 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:31:10,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366022228] [2025-03-17 05:31:10,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366022228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:31:10,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:31:10,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:31:10,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751974724] [2025-03-17 05:31:10,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:31:10,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:31:10,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:31:10,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:31:10,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:31:10,626 INFO L87 Difference]: Start difference. First operand 701 states and 829 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:31:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:10,729 INFO L93 Difference]: Finished difference Result 1340 states and 1580 transitions. [2025-03-17 05:31:10,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:31:10,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-03-17 05:31:10,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:10,733 INFO L225 Difference]: With dead ends: 1340 [2025-03-17 05:31:10,733 INFO L226 Difference]: Without dead ends: 701 [2025-03-17 05:31:10,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 136 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-03-17 05:31:10,734 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 367 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-03-17 05:31:10,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 367 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:31:10,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-03-17 05:31:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2025-03-17 05:31:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 568 states have (on average 1.1144366197183098) internal successors, (633), 574 states have internal predecessors, (633), 96 states have call successors, (96), 36 states have call predecessors, (96), 36 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 05:31:10,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 825 transitions. [2025-03-17 05:31:10,815 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 825 transitions. Word has length 139 [2025-03-17 05:31:10,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:10,815 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 825 transitions. [2025-03-17 05:31:10,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:31:10,815 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 825 transitions. [2025-03-17 05:31:10,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:31:10,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:10,816 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:31:10,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2025-03-17 05:31:11,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:11,017 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:11,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:11,021 INFO L85 PathProgramCache]: Analyzing trace with hash 528738483, now seen corresponding path program 1 times [2025-03-17 05:31:11,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:31:11,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017143624] [2025-03-17 05:31:11,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:11,021 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-03-17 05:31:11,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:31:11,023 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:11,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2025-03-17 05:31:11,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:31:11,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:31:11,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:11,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:11,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 05:31:11,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:31:11,303 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 23 treesize of output 22 [2025-03-17 05:31:11,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:31:11,398 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 47 treesize of output 30 [2025-03-17 05:31:11,658 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 16 [2025-03-17 05:31:11,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:31:11,736 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 54 treesize of output 30 [2025-03-17 05:31:11,739 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 24 treesize of output 12 [2025-03-17 05:31:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 293 proven. 30 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2025-03-17 05:31:11,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:31:12,006 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:31:12,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017143624] [2025-03-17 05:31:12,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017143624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:31:12,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1540432942] [2025-03-17 05:31:12,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:12,007 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:31:12,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:31:12,008 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:31:12,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2025-03-17 05:31:12,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:31:12,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:31:12,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:12,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:12,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:31:12,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:31:12,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-17 05:31:12,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:31:12,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-17 05:31:13,075 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 16 [2025-03-17 05:31:13,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 05:31:13,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:31:13,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 25 [2025-03-17 05:31:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 268 proven. 30 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-03-17 05:31:13,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:31:13,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1540432942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:31:13,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:31:13,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-03-17 05:31:13,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061438776] [2025-03-17 05:31:13,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:31:13,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:31:13,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:31:13,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:31:13,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:31:13,390 INFO L87 Difference]: Start difference. First operand 701 states and 825 transitions. Second operand has 17 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 7 states have call successors, (34), 5 states have call predecessors, (34), 7 states have return successors, (34), 6 states have call predecessors, (34), 7 states have call successors, (34) [2025-03-17 05:31:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:14,596 INFO L93 Difference]: Finished difference Result 1594 states and 1858 transitions. [2025-03-17 05:31:14,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:31:14,597 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 7 states have call successors, (34), 5 states have call predecessors, (34), 7 states have return successors, (34), 6 states have call predecessors, (34), 7 states have call successors, (34) Word has length 140 [2025-03-17 05:31:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:14,600 INFO L225 Difference]: With dead ends: 1594 [2025-03-17 05:31:14,600 INFO L226 Difference]: Without dead ends: 984 [2025-03-17 05:31:14,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 467 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=364, Invalid=1042, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 05:31:14,601 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 262 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:14,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1717 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:31:14,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2025-03-17 05:31:14,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 974. [2025-03-17 05:31:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 793 states have (on average 1.1185372005044136) internal successors, (887), 799 states have internal predecessors, (887), 126 states have call successors, (126), 54 states have call predecessors, (126), 54 states have return successors, (126), 120 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-17 05:31:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1139 transitions. [2025-03-17 05:31:14,725 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1139 transitions. Word has length 140 [2025-03-17 05:31:14,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:14,725 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1139 transitions. [2025-03-17 05:31:14,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 7 states have call successors, (34), 5 states have call predecessors, (34), 7 states have return successors, (34), 6 states have call predecessors, (34), 7 states have call successors, (34) [2025-03-17 05:31:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1139 transitions. [2025-03-17 05:31:14,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:31:14,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:14,726 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:31:14,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2025-03-17 05:31:14,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2025-03-17 05:31:15,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:31:15,127 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:15,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:15,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1564752089, now seen corresponding path program 1 times [2025-03-17 05:31:15,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:31:15,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398594959] [2025-03-17 05:31:15,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:15,128 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-03-17 05:31:15,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:31:15,130 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:15,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2025-03-17 05:31:15,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:31:15,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:31:15,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:15,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:15,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 05:31:15,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:31:15,452 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-03-17 05:31:16,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 59 [2025-03-17 05:31:16,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:31:16,285 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 195 treesize of output 75 [2025-03-17 05:31:16,319 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 220 proven. 36 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 05:31:16,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:31:16,443 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:31:16,443 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:31:16,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398594959] [2025-03-17 05:31:16,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398594959] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:31:16,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:31:16,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2025-03-17 05:31:16,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537995828] [2025-03-17 05:31:16,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:31:16,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:31:16,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:31:16,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:31:16,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:31:16,444 INFO L87 Difference]: Start difference. First operand 974 states and 1139 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:17,176 INFO L93 Difference]: Finished difference Result 2037 states and 2357 transitions. [2025-03-17 05:31:17,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:31:17,177 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-03-17 05:31:17,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:17,181 INFO L225 Difference]: With dead ends: 2037 [2025-03-17 05:31:17,181 INFO L226 Difference]: Without dead ends: 1162 [2025-03-17 05:31:17,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:31:17,183 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 92 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:17,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 508 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:31:17,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2025-03-17 05:31:17,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 974. [2025-03-17 05:31:17,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 793 states have (on average 1.128625472887768) internal successors, (895), 799 states have internal predecessors, (895), 126 states have call successors, (126), 54 states have call predecessors, (126), 54 states have return successors, (126), 120 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-17 05:31:17,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1147 transitions. [2025-03-17 05:31:17,318 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1147 transitions. Word has length 141 [2025-03-17 05:31:17,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:17,318 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1147 transitions. [2025-03-17 05:31:17,318 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:17,318 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1147 transitions. [2025-03-17 05:31:17,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:31:17,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:17,320 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:31:17,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2025-03-17 05:31:17,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:17,520 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:17,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:17,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2034714345, now seen corresponding path program 1 times [2025-03-17 05:31:17,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:31:17,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063839352] [2025-03-17 05:31:17,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:17,521 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-03-17 05:31:17,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:31:17,522 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:17,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2025-03-17 05:31:17,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:31:17,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:31:17,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:17,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:17,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 05:31:17,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:31:18,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 48 [2025-03-17 05:31:18,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:31:18,349 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 119 treesize of output 47 [2025-03-17 05:31:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 216 proven. 36 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-03-17 05:31:18,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:31:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:31:18,500 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:31:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063839352] [2025-03-17 05:31:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1063839352] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:31:18,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:31:18,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-03-17 05:31:18,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302941479] [2025-03-17 05:31:18,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:31:18,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:31:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:31:18,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:31:18,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:31:18,501 INFO L87 Difference]: Start difference. First operand 974 states and 1147 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:19,161 INFO L93 Difference]: Finished difference Result 2278 states and 2655 transitions. [2025-03-17 05:31:19,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:31:19,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-03-17 05:31:19,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:19,166 INFO L225 Difference]: With dead ends: 2278 [2025-03-17 05:31:19,166 INFO L226 Difference]: Without dead ends: 1403 [2025-03-17 05:31:19,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:31:19,168 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 164 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:19,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 307 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:31:19,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-03-17 05:31:19,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 849. [2025-03-17 05:31:19,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 668 states have (on average 1.1092814371257484) internal successors, (741), 674 states have internal predecessors, (741), 126 states have call successors, (126), 54 states have call predecessors, (126), 54 states have return successors, (126), 120 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-17 05:31:19,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 993 transitions. [2025-03-17 05:31:19,299 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 993 transitions. Word has length 141 [2025-03-17 05:31:19,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:19,299 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 993 transitions. [2025-03-17 05:31:19,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:19,300 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 993 transitions. [2025-03-17 05:31:19,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:31:19,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:19,300 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:31:19,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2025-03-17 05:31:19,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:19,501 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:19,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:19,501 INFO L85 PathProgramCache]: Analyzing trace with hash -732231723, now seen corresponding path program 1 times [2025-03-17 05:31:19,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:31:19,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990539678] [2025-03-17 05:31:19,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:19,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:31:19,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:31:19,504 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:19,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2025-03-17 05:31:19,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:31:19,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:31:19,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:19,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:19,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:31:19,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:31:19,761 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 46 treesize of output 22 [2025-03-17 05:31:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:31:19,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:31:19,780 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:31:19,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990539678] [2025-03-17 05:31:19,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990539678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:31:19,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:31:19,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:31:19,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339108970] [2025-03-17 05:31:19,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:31:19,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:31:19,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:31:19,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:31:19,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:31:19,781 INFO L87 Difference]: Start difference. First operand 849 states and 993 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:20,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:20,323 INFO L93 Difference]: Finished difference Result 2040 states and 2367 transitions. [2025-03-17 05:31:20,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:31:20,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-03-17 05:31:20,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:20,329 INFO L225 Difference]: With dead ends: 2040 [2025-03-17 05:31:20,330 INFO L226 Difference]: Without dead ends: 1290 [2025-03-17 05:31:20,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:31:20,331 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 101 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:20,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 705 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:31:20,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-03-17 05:31:20,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 841. [2025-03-17 05:31:20,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 660 states have (on average 1.1045454545454545) internal successors, (729), 666 states have internal predecessors, (729), 126 states have call successors, (126), 54 states have call predecessors, (126), 54 states have return successors, (126), 120 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-17 05:31:20,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 981 transitions. [2025-03-17 05:31:20,470 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 981 transitions. Word has length 141 [2025-03-17 05:31:20,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:20,470 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 981 transitions. [2025-03-17 05:31:20,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:20,470 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 981 transitions. [2025-03-17 05:31:20,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:31:20,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:20,471 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:31:20,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2025-03-17 05:31:20,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:20,672 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:20,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:20,672 INFO L85 PathProgramCache]: Analyzing trace with hash 883219921, now seen corresponding path program 1 times [2025-03-17 05:31:20,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:31:20,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610107640] [2025-03-17 05:31:20,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:20,673 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-03-17 05:31:20,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:31:20,675 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:20,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2025-03-17 05:31:20,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:31:20,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:31:20,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:20,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:20,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 05:31:20,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:31:21,356 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 119 treesize of output 59 [2025-03-17 05:31:21,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:31:21,389 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 189 treesize of output 75 [2025-03-17 05:31:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 12 proven. 244 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 05:31:21,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:31:21,456 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:31:21,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610107640] [2025-03-17 05:31:21,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610107640] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:31:21,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [267328471] [2025-03-17 05:31:21,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:21,456 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:31:21,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:31:21,458 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:31:21,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2025-03-17 05:31:21,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:31:22,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:31:22,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:22,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:22,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 05:31:22,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:31:22,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 59 [2025-03-17 05:31:23,090 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 220 proven. 36 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 05:31:23,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:31:23,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [267328471] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:31:23,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:31:23,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2025-03-17 05:31:23,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810720701] [2025-03-17 05:31:23,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:31:23,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 05:31:23,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:31:23,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 05:31:23,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:31:23,157 INFO L87 Difference]: Start difference. First operand 841 states and 981 transitions. Second operand has 20 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 5 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 3 states have call predecessors, (30), 5 states have call successors, (30) [2025-03-17 05:31:24,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:24,286 INFO L93 Difference]: Finished difference Result 2207 states and 2550 transitions. [2025-03-17 05:31:24,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 05:31:24,287 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 5 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 3 states have call predecessors, (30), 5 states have call successors, (30) Word has length 141 [2025-03-17 05:31:24,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:24,292 INFO L225 Difference]: With dead ends: 2207 [2025-03-17 05:31:24,292 INFO L226 Difference]: Without dead ends: 1465 [2025-03-17 05:31:24,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=782, Unknown=0, NotChecked=0, Total=992 [2025-03-17 05:31:24,294 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 378 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:24,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1226 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:31:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2025-03-17 05:31:24,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1025. [2025-03-17 05:31:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 773 states have (on average 1.0918499353169469) internal successors, (844), 782 states have internal predecessors, (844), 179 states have call successors, (179), 72 states have call predecessors, (179), 72 states have return successors, (179), 170 states have call predecessors, (179), 179 states have call successors, (179) [2025-03-17 05:31:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1202 transitions. [2025-03-17 05:31:24,472 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1202 transitions. Word has length 141 [2025-03-17 05:31:24,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:24,472 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1202 transitions. [2025-03-17 05:31:24,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 5 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 3 states have call predecessors, (30), 5 states have call successors, (30) [2025-03-17 05:31:24,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1202 transitions. [2025-03-17 05:31:24,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:31:24,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:24,473 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:31:24,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Ended with exit code 0 [2025-03-17 05:31:24,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2025-03-17 05:31:24,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:31:24,874 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:24,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:24,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1234019858, now seen corresponding path program 1 times [2025-03-17 05:31:24,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:31:24,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466395088] [2025-03-17 05:31:24,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:24,875 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-03-17 05:31:24,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:31:24,876 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:24,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2025-03-17 05:31:24,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:31:25,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:31:25,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:25,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:25,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 05:31:25,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:31:25,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 59 [2025-03-17 05:31:26,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:31:26,691 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 233 treesize of output 101 [2025-03-17 05:31:26,743 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 220 proven. 36 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 05:31:26,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:31:26,844 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:31:26,844 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:31:26,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466395088] [2025-03-17 05:31:26,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466395088] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:31:26,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:31:26,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2025-03-17 05:31:26,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867168123] [2025-03-17 05:31:26,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:31:26,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:31:26,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:31:26,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:31:26,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:31:26,845 INFO L87 Difference]: Start difference. First operand 1025 states and 1202 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:27,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:27,340 INFO L93 Difference]: Finished difference Result 2654 states and 3092 transitions. [2025-03-17 05:31:27,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:31:27,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-03-17 05:31:27,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:27,346 INFO L225 Difference]: With dead ends: 2654 [2025-03-17 05:31:27,346 INFO L226 Difference]: Without dead ends: 1766 [2025-03-17 05:31:27,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 250 SyntacticMatches, 17 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:31:27,348 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 163 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:27,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 424 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:31:27,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2025-03-17 05:31:27,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1132. [2025-03-17 05:31:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 880 states have (on average 1.1) internal successors, (968), 889 states have internal predecessors, (968), 179 states have call successors, (179), 72 states have call predecessors, (179), 72 states have return successors, (179), 170 states have call predecessors, (179), 179 states have call successors, (179) [2025-03-17 05:31:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1326 transitions. [2025-03-17 05:31:27,528 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1326 transitions. Word has length 141 [2025-03-17 05:31:27,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:27,528 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1326 transitions. [2025-03-17 05:31:27,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:27,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1326 transitions. [2025-03-17 05:31:27,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:31:27,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:27,529 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:31:27,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Ended with exit code 0 [2025-03-17 05:31:27,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:27,730 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:27,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:27,730 INFO L85 PathProgramCache]: Analyzing trace with hash 940616851, now seen corresponding path program 1 times [2025-03-17 05:31:27,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:31:27,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515073016] [2025-03-17 05:31:27,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:27,731 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-03-17 05:31:27,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:31:27,732 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:31:27,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2025-03-17 05:31:27,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:31:28,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:31:28,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:28,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:28,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 05:31:28,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:31:28,041 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-03-17 05:31:28,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 59