./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-88.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 ee043a380462a1c76ab3130ca5e702431f3ce27542f408d77a3f5f81e3836d71 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:11:29,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:11:29,087 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:11:29,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:11:29,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:11:29,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:11:29,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:11:29,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:11:29,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:11:29,115 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:11:29,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:11:29,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:11:29,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:11:29,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:11:29,115 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:11:29,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:11:29,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:11:29,117 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:11:29,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:11:29,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:11:29,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:11:29,117 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:11:29,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:11:29,118 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:11:29,118 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:11:29,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:11:29,118 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:11:29,118 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:11:29,118 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:11:29,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:11:29,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:11:29,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:11:29,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:11:29,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:11:29,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:11:29,119 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:11:29,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:11:29,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:11:29,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:11:29,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:11:29,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:11:29,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:11:29,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:11:29,120 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 -> ee043a380462a1c76ab3130ca5e702431f3ce27542f408d77a3f5f81e3836d71 [2025-03-04 01:11:29,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:11:29,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:11:29,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:11:29,380 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:11:29,380 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:11:29,381 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-88.i [2025-03-04 01:11:30,442 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491b0b573/ad2671914c684efba8ba7e1359119964/FLAGfbc7aec7b [2025-03-04 01:11:30,652 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:11:30,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i [2025-03-04 01:11:30,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491b0b573/ad2671914c684efba8ba7e1359119964/FLAGfbc7aec7b [2025-03-04 01:11:31,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491b0b573/ad2671914c684efba8ba7e1359119964 [2025-03-04 01:11:31,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:11:31,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:11:31,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:11:31,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:11:31,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:11:31,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:11:31" (1/1) ... [2025-03-04 01:11:31,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f713cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:31, skipping insertion in model container [2025-03-04 01:11:31,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:11:31" (1/1) ... [2025-03-04 01:11:31,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:11:31,120 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-88.i[916,929] [2025-03-04 01:11:31,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:11:31,168 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:11:31,174 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-88.i[916,929] [2025-03-04 01:11:31,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:11:31,220 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:11:31,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:31 WrapperNode [2025-03-04 01:11:31,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:11:31,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:11:31,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:11:31,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:11:31,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:31" (1/1) ... [2025-03-04 01:11:31,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:31" (1/1) ... [2025-03-04 01:11:31,259 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 528 [2025-03-04 01:11:31,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:11:31,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:11:31,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:11:31,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:11:31,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:31" (1/1) ... [2025-03-04 01:11:31,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:31" (1/1) ... [2025-03-04 01:11:31,269 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:31" (1/1) ... [2025-03-04 01:11:31,282 INFO L175 MemorySlicer]: Split 134 memory accesses to 8 slices as follows [2, 16, 11, 54, 3, 4, 10, 34]. 40 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 2, 4, 1, 1, 2, 4]. The 19 writes are split as follows [0, 2, 2, 6, 1, 1, 2, 5]. [2025-03-04 01:11:31,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:31" (1/1) ... [2025-03-04 01:11:31,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:31" (1/1) ... [2025-03-04 01:11:31,303 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:31" (1/1) ... [2025-03-04 01:11:31,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:31" (1/1) ... [2025-03-04 01:11:31,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:31" (1/1) ... [2025-03-04 01:11:31,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:31" (1/1) ... [2025-03-04 01:11:31,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:11:31,322 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:11:31,322 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:11:31,322 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:11:31,323 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:31" (1/1) ... [2025-03-04 01:11:31,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:11:31,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:31,352 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-04 01:11:31,354 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-04 01:11:31,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:11:31,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:11:31,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:11:31,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:11:31,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:11:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:11:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:11:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:11:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:11:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:11:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-04 01:11:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-04 01:11:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:11:31,376 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:11:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:11:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:11:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:11:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:11:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:11:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:11:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 01:11:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 01:11:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:11:31,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:11:31,511 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:11:31,514 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:11:31,973 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc property_#t~bitwise79#1;havoc property_#t~mem80#1;havoc property_#t~short81#1;havoc property_#t~ite92#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~short84#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem93#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~short110#1;havoc property_#t~ite121#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~ite115#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite130#1;havoc property_#t~mem129#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~short131#1;havoc property_#t~mem132#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2025-03-04 01:11:32,001 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2025-03-04 01:11:32,005 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:11:32,026 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:11:32,027 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:11:32,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:11:32 BoogieIcfgContainer [2025-03-04 01:11:32,027 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:11:32,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:11:32,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:11:32,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:11:32,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:11:31" (1/3) ... [2025-03-04 01:11:32,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e933ea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:11:32, skipping insertion in model container [2025-03-04 01:11:32,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:31" (2/3) ... [2025-03-04 01:11:32,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e933ea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:11:32, skipping insertion in model container [2025-03-04 01:11:32,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:11:32" (3/3) ... [2025-03-04 01:11:32,034 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-88.i [2025-03-04 01:11:32,045 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:11:32,046 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-88.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:11:32,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:11:32,096 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;@dbbac4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:11:32,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:11:32,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 99 states have internal predecessors, (139), 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-04 01:11:32,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:11:32,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:32,112 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, 1, 1] [2025-03-04 01:11:32,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:32,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:32,118 INFO L85 PathProgramCache]: Analyzing trace with hash -820715542, now seen corresponding path program 1 times [2025-03-04 01:11:32,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:32,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320750015] [2025-03-04 01:11:32,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:32,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:32,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:11:32,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:11:32,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:32,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:32,445 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-04 01:11:32,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:32,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320750015] [2025-03-04 01:11:32,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320750015] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:11:32,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107781269] [2025-03-04 01:11:32,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:32,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:32,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:32,449 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-04 01:11:32,451 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-04 01:11:32,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:11:32,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:11:32,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:32,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:32,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:11:32,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:32,703 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-04 01:11:32,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:32,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107781269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:32,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:11:32,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:11:32,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428152792] [2025-03-04 01:11:32,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:32,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:11:32,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:32,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:11:32,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:11:32,728 INFO L87 Difference]: Start difference. First operand has 118 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 99 states have internal predecessors, (139), 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 31.5) internal successors, (63), 2 states have internal predecessors, (63), 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-04 01:11:32,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:32,749 INFO L93 Difference]: Finished difference Result 230 states and 358 transitions. [2025-03-04 01:11:32,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:11:32,752 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 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 143 [2025-03-04 01:11:32,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:32,757 INFO L225 Difference]: With dead ends: 230 [2025-03-04 01:11:32,757 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 01:11:32,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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-04 01:11:32,762 INFO L435 NwaCegarLoop]: 166 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, 166 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-04 01:11:32,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:32,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 01:11:32,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-04 01:11:32,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 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-04 01:11:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2025-03-04 01:11:32,788 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 143 [2025-03-04 01:11:32,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:32,788 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2025-03-04 01:11:32,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 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-04 01:11:32,788 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2025-03-04 01:11:32,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:11:32,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:32,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, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:32,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:11:32,991 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-04 01:11:32,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:32,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:32,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1385401869, now seen corresponding path program 1 times [2025-03-04 01:11:32,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:32,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535023271] [2025-03-04 01:11:32,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:32,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:33,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:11:33,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:11:33,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:33,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:33,287 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-04 01:11:33,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:33,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535023271] [2025-03-04 01:11:33,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535023271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:33,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:33,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:11:33,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983281265] [2025-03-04 01:11:33,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:33,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:11:33,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:33,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:11:33,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:11:33,289 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-04 01:11:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:33,327 INFO L93 Difference]: Finished difference Result 230 states and 337 transitions. [2025-03-04 01:11:33,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:11:33,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 143 [2025-03-04 01:11:33,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:33,330 INFO L225 Difference]: With dead ends: 230 [2025-03-04 01:11:33,332 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 01:11:33,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:11:33,334 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 478 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-04 01:11:33,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 478 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:33,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 01:11:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-04 01:11:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 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-04 01:11:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2025-03-04 01:11:33,343 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 143 [2025-03-04 01:11:33,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:33,344 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2025-03-04 01:11:33,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-04 01:11:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2025-03-04 01:11:33,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:11:33,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:33,346 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, 1, 1] [2025-03-04 01:11:33,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:11:33,346 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:33,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:33,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1102110964, now seen corresponding path program 1 times [2025-03-04 01:11:33,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:33,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650219963] [2025-03-04 01:11:33,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:33,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:33,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:11:33,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:11:33,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:33,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:33,541 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-04 01:11:33,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:33,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650219963] [2025-03-04 01:11:33,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650219963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:33,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:33,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:11:33,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961633316] [2025-03-04 01:11:33,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:33,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:11:33,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:33,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:11:33,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:11:33,543 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-04 01:11:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:33,573 INFO L93 Difference]: Finished difference Result 234 states and 341 transitions. [2025-03-04 01:11:33,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:11:33,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 143 [2025-03-04 01:11:33,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:33,576 INFO L225 Difference]: With dead ends: 234 [2025-03-04 01:11:33,577 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 01:11:33,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:11:33,578 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 479 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-04 01:11:33,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 479 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:33,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 01:11:33,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-03-04 01:11:33,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 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-04 01:11:33,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2025-03-04 01:11:33,593 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 143 [2025-03-04 01:11:33,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:33,594 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2025-03-04 01:11:33,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-04 01:11:33,594 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2025-03-04 01:11:33,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:11:33,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:33,595 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, 1, 1] [2025-03-04 01:11:33,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:11:33,595 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:33,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:33,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1989614645, now seen corresponding path program 1 times [2025-03-04 01:11:33,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:33,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452926694] [2025-03-04 01:11:33,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:33,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:33,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:11:33,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:11:33,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:33,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:33,740 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-04 01:11:33,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:33,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452926694] [2025-03-04 01:11:33,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452926694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:33,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:33,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:11:33,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686501310] [2025-03-04 01:11:33,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:33,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:11:33,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:33,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:11:33,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:11:33,745 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-04 01:11:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:33,773 INFO L93 Difference]: Finished difference Result 238 states and 345 transitions. [2025-03-04 01:11:33,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:11:33,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 143 [2025-03-04 01:11:33,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:33,776 INFO L225 Difference]: With dead ends: 238 [2025-03-04 01:11:33,776 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 01:11:33,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:11:33,777 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 481 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-04 01:11:33,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 481 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:33,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 01:11:33,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2025-03-04 01:11:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 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-04 01:11:33,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 174 transitions. [2025-03-04 01:11:33,790 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 174 transitions. Word has length 143 [2025-03-04 01:11:33,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:33,791 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 174 transitions. [2025-03-04 01:11:33,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-04 01:11:33,791 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2025-03-04 01:11:33,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:11:33,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:33,792 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, 1, 1] [2025-03-04 01:11:33,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:11:33,792 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:33,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:33,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1990538166, now seen corresponding path program 1 times [2025-03-04 01:11:33,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:33,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580733491] [2025-03-04 01:11:33,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:33,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:33,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:11:33,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:11:33,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:33,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:34,335 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-04 01:11:34,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:34,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580733491] [2025-03-04 01:11:34,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580733491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:34,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:34,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:11:34,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714815818] [2025-03-04 01:11:34,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:34,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:11:34,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:34,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:11:34,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:11:34,339 INFO L87 Difference]: Start difference. First operand 121 states and 174 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-04 01:11:34,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:34,467 INFO L93 Difference]: Finished difference Result 266 states and 382 transitions. [2025-03-04 01:11:34,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:11:34,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 143 [2025-03-04 01:11:34,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:34,469 INFO L225 Difference]: With dead ends: 266 [2025-03-04 01:11:34,470 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 01:11:34,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:34,471 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 108 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:34,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 564 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:34,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 01:11:34,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2025-03-04 01:11:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 120 states have (on average 1.3416666666666666) internal successors, (161), 121 states have internal predecessors, (161), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:11:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 209 transitions. [2025-03-04 01:11:34,488 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 209 transitions. Word has length 143 [2025-03-04 01:11:34,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:34,488 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 209 transitions. [2025-03-04 01:11:34,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-04 01:11:34,488 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 209 transitions. [2025-03-04 01:11:34,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 01:11:34,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:34,503 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, 1, 1, 1, 1] [2025-03-04 01:11:34,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:11:34,503 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:34,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:34,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1788538224, now seen corresponding path program 1 times [2025-03-04 01:11:34,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:34,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623127422] [2025-03-04 01:11:34,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:34,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:34,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 01:11:34,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 01:11:34,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:34,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:34,710 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-04 01:11:34,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:34,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623127422] [2025-03-04 01:11:34,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623127422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:11:34,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307575072] [2025-03-04 01:11:34,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:34,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:34,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:34,713 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-04 01:11:34,714 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-04 01:11:34,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 01:11:34,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 01:11:34,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:34,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:34,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:11:34,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:34,951 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-04 01:11:34,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:34,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307575072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:34,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:11:34,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:11:34,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505537784] [2025-03-04 01:11:34,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:34,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:11:34,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:34,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:11:34,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:11:34,953 INFO L87 Difference]: Start difference. First operand 147 states and 209 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-04 01:11:34,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:34,988 INFO L93 Difference]: Finished difference Result 274 states and 389 transitions. [2025-03-04 01:11:34,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:11:34,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 145 [2025-03-04 01:11:34,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:34,991 INFO L225 Difference]: With dead ends: 274 [2025-03-04 01:11:34,991 INFO L226 Difference]: Without dead ends: 150 [2025-03-04 01:11:34,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:11:34,992 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:34,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 635 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:34,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-04 01:11:35,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-03-04 01:11:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 123 states have (on average 1.3333333333333333) internal successors, (164), 124 states have internal predecessors, (164), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:11:35,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 212 transitions. [2025-03-04 01:11:35,001 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 212 transitions. Word has length 145 [2025-03-04 01:11:35,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:35,002 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 212 transitions. [2025-03-04 01:11:35,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-04 01:11:35,002 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 212 transitions. [2025-03-04 01:11:35,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 01:11:35,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:35,003 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, 1, 1, 1, 1, 1] [2025-03-04 01:11:35,010 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-04 01:11:35,204 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,SelfDestructingSolverStorable5 [2025-03-04 01:11:35,204 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:35,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:35,204 INFO L85 PathProgramCache]: Analyzing trace with hash 97676083, now seen corresponding path program 1 times [2025-03-04 01:11:35,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:35,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521428460] [2025-03-04 01:11:35,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:35,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:35,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:11:35,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:11:35,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:35,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:35,659 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-04 01:11:35,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:35,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521428460] [2025-03-04 01:11:35,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521428460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:35,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:35,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:11:35,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962387293] [2025-03-04 01:11:35,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:35,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:11:35,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:35,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:11:35,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:35,662 INFO L87 Difference]: Start difference. First operand 150 states and 212 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-04 01:11:35,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:35,819 INFO L93 Difference]: Finished difference Result 278 states and 392 transitions. [2025-03-04 01:11:35,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:11:35,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 146 [2025-03-04 01:11:35,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:35,822 INFO L225 Difference]: With dead ends: 278 [2025-03-04 01:11:35,822 INFO L226 Difference]: Without dead ends: 151 [2025-03-04 01:11:35,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-04 01:11:35,823 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 103 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:35,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 722 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:35,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-04 01:11:35,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2025-03-04 01:11:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 121 states have (on average 1.3305785123966942) internal successors, (161), 122 states have internal predecessors, (161), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:11:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 209 transitions. [2025-03-04 01:11:35,839 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 209 transitions. Word has length 146 [2025-03-04 01:11:35,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:35,839 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 209 transitions. [2025-03-04 01:11:35,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-04 01:11:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 209 transitions. [2025-03-04 01:11:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 01:11:35,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:35,841 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, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:35,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:11:35,841 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:35,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:35,841 INFO L85 PathProgramCache]: Analyzing trace with hash -550674158, now seen corresponding path program 1 times [2025-03-04 01:11:35,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:35,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850020699] [2025-03-04 01:11:35,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:35,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:35,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 01:11:35,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 01:11:35,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:35,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:36,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-04 01:11:36,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:36,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850020699] [2025-03-04 01:11:36,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850020699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:36,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:36,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:11:36,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816682630] [2025-03-04 01:11:36,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:36,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:11:36,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:36,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:11:36,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:11:36,235 INFO L87 Difference]: Start difference. First operand 148 states and 209 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-04 01:11:36,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:36,383 INFO L93 Difference]: Finished difference Result 316 states and 447 transitions. [2025-03-04 01:11:36,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:11:36,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 147 [2025-03-04 01:11:36,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:36,385 INFO L225 Difference]: With dead ends: 316 [2025-03-04 01:11:36,385 INFO L226 Difference]: Without dead ends: 191 [2025-03-04 01:11:36,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:11:36,386 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 86 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:36,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 447 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:36,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-04 01:11:36,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 176. [2025-03-04 01:11:36,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 138 states have (on average 1.289855072463768) internal successors, (178), 138 states have internal predecessors, (178), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:11:36,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 246 transitions. [2025-03-04 01:11:36,400 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 246 transitions. Word has length 147 [2025-03-04 01:11:36,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:36,400 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 246 transitions. [2025-03-04 01:11:36,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-04 01:11:36,400 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 246 transitions. [2025-03-04 01:11:36,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 01:11:36,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:36,401 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:36,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:11:36,402 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:36,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:36,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2008551832, now seen corresponding path program 1 times [2025-03-04 01:11:36,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:36,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866976386] [2025-03-04 01:11:36,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:36,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:36,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 01:11:36,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 01:11:36,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:36,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:36,504 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-04 01:11:36,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:36,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866976386] [2025-03-04 01:11:36,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866976386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:36,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:36,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:11:36,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839897819] [2025-03-04 01:11:36,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:36,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:11:36,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:36,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:11:36,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:11:36,506 INFO L87 Difference]: Start difference. First operand 176 states and 246 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-04 01:11:36,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:36,541 INFO L93 Difference]: Finished difference Result 372 states and 523 transitions. [2025-03-04 01:11:36,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:11:36,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 149 [2025-03-04 01:11:36,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:36,543 INFO L225 Difference]: With dead ends: 372 [2025-03-04 01:11:36,543 INFO L226 Difference]: Without dead ends: 247 [2025-03-04 01:11:36,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:11:36,543 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 85 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:36,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 313 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:36,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-04 01:11:36,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 198. [2025-03-04 01:11:36,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 160 states have (on average 1.325) internal successors, (212), 160 states have internal predecessors, (212), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:11:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 280 transitions. [2025-03-04 01:11:36,561 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 280 transitions. Word has length 149 [2025-03-04 01:11:36,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:36,561 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 280 transitions. [2025-03-04 01:11:36,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-04 01:11:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 280 transitions. [2025-03-04 01:11:36,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:11:36,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:36,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:36,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:11:36,563 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:36,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:36,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1663535376, now seen corresponding path program 1 times [2025-03-04 01:11:36,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:36,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635826530] [2025-03-04 01:11:36,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:36,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:36,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:11:36,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:11:36,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:36,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:36,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-04 01:11:36,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:36,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635826530] [2025-03-04 01:11:36,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635826530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:36,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:36,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:11:36,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132744821] [2025-03-04 01:11:36,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:36,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:11:36,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:36,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:11:36,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:11:36,643 INFO L87 Difference]: Start difference. First operand 198 states and 280 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-04 01:11:36,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:36,679 INFO L93 Difference]: Finished difference Result 417 states and 592 transitions. [2025-03-04 01:11:36,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:11:36,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 150 [2025-03-04 01:11:36,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:36,682 INFO L225 Difference]: With dead ends: 417 [2025-03-04 01:11:36,682 INFO L226 Difference]: Without dead ends: 270 [2025-03-04 01:11:36,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:11:36,683 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 82 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:36,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 316 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:36,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-04 01:11:36,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 221. [2025-03-04 01:11:36,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 183 states have (on average 1.349726775956284) internal successors, (247), 183 states have internal predecessors, (247), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:11:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 315 transitions. [2025-03-04 01:11:36,699 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 315 transitions. Word has length 150 [2025-03-04 01:11:36,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:36,699 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 315 transitions. [2025-03-04 01:11:36,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-04 01:11:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 315 transitions. [2025-03-04 01:11:36,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:11:36,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:36,700 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:36,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:11:36,701 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:36,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:36,701 INFO L85 PathProgramCache]: Analyzing trace with hash 338399766, now seen corresponding path program 1 times [2025-03-04 01:11:36,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:36,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220203232] [2025-03-04 01:11:36,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:36,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:36,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:11:36,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:11:36,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:36,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:37,162 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-04 01:11:37,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:37,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220203232] [2025-03-04 01:11:37,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220203232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:37,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:37,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:11:37,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742477412] [2025-03-04 01:11:37,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:37,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:11:37,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:37,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:11:37,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:37,164 INFO L87 Difference]: Start difference. First operand 221 states and 315 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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-04 01:11:37,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:37,283 INFO L93 Difference]: Finished difference Result 505 states and 718 transitions. [2025-03-04 01:11:37,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:11:37,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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 151 [2025-03-04 01:11:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:37,285 INFO L225 Difference]: With dead ends: 505 [2025-03-04 01:11:37,286 INFO L226 Difference]: Without dead ends: 335 [2025-03-04 01:11:37,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:37,286 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 76 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:37,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 807 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:37,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-04 01:11:37,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2025-03-04 01:11:37,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 290 states have (on average 1.3724137931034484) internal successors, (398), 291 states have internal predecessors, (398), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:11:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 470 transitions. [2025-03-04 01:11:37,309 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 470 transitions. Word has length 151 [2025-03-04 01:11:37,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:37,309 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 470 transitions. [2025-03-04 01:11:37,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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-04 01:11:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 470 transitions. [2025-03-04 01:11:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:11:37,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:37,314 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:37,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:11:37,314 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:37,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:37,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2006267275, now seen corresponding path program 1 times [2025-03-04 01:11:37,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:37,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930852380] [2025-03-04 01:11:37,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:37,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:37,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:11:37,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:11:37,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:37,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:37,680 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-04 01:11:37,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:37,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930852380] [2025-03-04 01:11:37,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930852380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:37,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:37,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:11:37,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388243692] [2025-03-04 01:11:37,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:37,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:11:37,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:37,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:11:37,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:37,682 INFO L87 Difference]: Start difference. First operand 332 states and 470 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-04 01:11:37,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:37,883 INFO L93 Difference]: Finished difference Result 633 states and 903 transitions. [2025-03-04 01:11:37,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:11:37,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 151 [2025-03-04 01:11:37,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:37,885 INFO L225 Difference]: With dead ends: 633 [2025-03-04 01:11:37,886 INFO L226 Difference]: Without dead ends: 356 [2025-03-04 01:11:37,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:11:37,887 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 85 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:37,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 701 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:11:37,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-04 01:11:37,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 335. [2025-03-04 01:11:37,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 293 states have (on average 1.3686006825938566) internal successors, (401), 294 states have internal predecessors, (401), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:11:37,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 473 transitions. [2025-03-04 01:11:37,910 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 473 transitions. Word has length 151 [2025-03-04 01:11:37,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:37,910 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 473 transitions. [2025-03-04 01:11:37,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-04 01:11:37,910 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 473 transitions. [2025-03-04 01:11:37,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:11:37,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:37,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:37,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:11:37,912 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:37,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:37,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1026697403, now seen corresponding path program 1 times [2025-03-04 01:11:37,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:37,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205636169] [2025-03-04 01:11:37,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:37,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:37,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:11:37,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:11:37,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:37,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:40,029 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-04 01:11:40,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:40,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205636169] [2025-03-04 01:11:40,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205636169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:40,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:40,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:11:40,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260660642] [2025-03-04 01:11:40,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:40,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:11:40,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:40,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:11:40,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:11:40,031 INFO L87 Difference]: Start difference. First operand 335 states and 473 transitions. Second operand has 9 states, 6 states have (on average 11.666666666666666) internal successors, (70), 9 states have internal predecessors, (70), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-04 01:11:40,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:40,295 INFO L93 Difference]: Finished difference Result 775 states and 1086 transitions. [2025-03-04 01:11:40,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:11:40,295 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 11.666666666666666) internal successors, (70), 9 states have internal predecessors, (70), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 4 states have call successors, (17) Word has length 152 [2025-03-04 01:11:40,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:40,298 INFO L225 Difference]: With dead ends: 775 [2025-03-04 01:11:40,298 INFO L226 Difference]: Without dead ends: 498 [2025-03-04 01:11:40,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:11:40,299 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 101 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:40,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1407 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:11:40,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-04 01:11:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 495. [2025-03-04 01:11:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 435 states have (on average 1.3402298850574712) internal successors, (583), 438 states have internal predecessors, (583), 51 states have call successors, (51), 8 states have call predecessors, (51), 8 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 01:11:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 685 transitions. [2025-03-04 01:11:40,322 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 685 transitions. Word has length 152 [2025-03-04 01:11:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:40,322 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 685 transitions. [2025-03-04 01:11:40,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 11.666666666666666) internal successors, (70), 9 states have internal predecessors, (70), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-04 01:11:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 685 transitions. [2025-03-04 01:11:40,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:11:40,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:40,324 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:40,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:11:40,325 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:40,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:40,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1394331539, now seen corresponding path program 1 times [2025-03-04 01:11:40,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:40,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636114057] [2025-03-04 01:11:40,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:40,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:40,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:11:40,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:11:40,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:40,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:40,651 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-04 01:11:40,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:40,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636114057] [2025-03-04 01:11:40,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636114057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:40,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:40,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:11:40,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698275091] [2025-03-04 01:11:40,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:40,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:11:40,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:40,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:11:40,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:40,653 INFO L87 Difference]: Start difference. First operand 495 states and 685 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 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-04 01:11:40,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:40,768 INFO L93 Difference]: Finished difference Result 1112 states and 1539 transitions. [2025-03-04 01:11:40,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:11:40,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 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 153 [2025-03-04 01:11:40,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:40,773 INFO L225 Difference]: With dead ends: 1112 [2025-03-04 01:11:40,773 INFO L226 Difference]: Without dead ends: 675 [2025-03-04 01:11:40,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:40,775 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 95 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:40,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 989 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-03-04 01:11:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 586. [2025-03-04 01:11:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 526 states have (on average 1.355513307984791) internal successors, (713), 529 states have internal predecessors, (713), 51 states have call successors, (51), 8 states have call predecessors, (51), 8 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 01:11:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 815 transitions. [2025-03-04 01:11:40,808 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 815 transitions. Word has length 153 [2025-03-04 01:11:40,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:40,808 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 815 transitions. [2025-03-04 01:11:40,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 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-04 01:11:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 815 transitions. [2025-03-04 01:11:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:11:40,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:40,810 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:40,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:11:40,810 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:40,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:40,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1723634563, now seen corresponding path program 1 times [2025-03-04 01:11:40,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:40,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560415312] [2025-03-04 01:11:40,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:40,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:40,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:11:40,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:11:40,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:40,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:40,882 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-04 01:11:40,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:40,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560415312] [2025-03-04 01:11:40,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560415312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:40,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:40,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:11:40,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852764532] [2025-03-04 01:11:40,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:40,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:11:40,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:40,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:11:40,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:11:40,884 INFO L87 Difference]: Start difference. First operand 586 states and 815 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-04 01:11:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:40,914 INFO L93 Difference]: Finished difference Result 1123 states and 1572 transitions. [2025-03-04 01:11:40,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:11:40,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 154 [2025-03-04 01:11:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:40,917 INFO L225 Difference]: With dead ends: 1123 [2025-03-04 01:11:40,917 INFO L226 Difference]: Without dead ends: 595 [2025-03-04 01:11:40,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:11:40,918 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:40,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:40,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-04 01:11:40,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-03-04 01:11:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 535 states have (on average 1.3495327102803738) internal successors, (722), 538 states have internal predecessors, (722), 51 states have call successors, (51), 8 states have call predecessors, (51), 8 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 01:11:40,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 824 transitions. [2025-03-04 01:11:40,951 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 824 transitions. Word has length 154 [2025-03-04 01:11:40,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:40,951 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 824 transitions. [2025-03-04 01:11:40,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-04 01:11:40,952 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 824 transitions. [2025-03-04 01:11:40,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:11:40,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:40,954 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:40,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:11:40,954 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:40,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:40,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1337199449, now seen corresponding path program 1 times [2025-03-04 01:11:40,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:40,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071941497] [2025-03-04 01:11:40,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:40,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:40,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:11:40,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:11:40,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:40,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:41,017 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-04 01:11:41,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:41,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071941497] [2025-03-04 01:11:41,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071941497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:41,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:41,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:11:41,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240899651] [2025-03-04 01:11:41,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:41,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:11:41,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:41,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:11:41,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:11:41,019 INFO L87 Difference]: Start difference. First operand 595 states and 824 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-04 01:11:41,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:41,050 INFO L93 Difference]: Finished difference Result 1136 states and 1580 transitions. [2025-03-04 01:11:41,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:11:41,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 154 [2025-03-04 01:11:41,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:41,053 INFO L225 Difference]: With dead ends: 1136 [2025-03-04 01:11:41,054 INFO L226 Difference]: Without dead ends: 599 [2025-03-04 01:11:41,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:11:41,055 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:41,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 320 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:41,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-04 01:11:41,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2025-03-04 01:11:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 539 states have (on average 1.346938775510204) internal successors, (726), 542 states have internal predecessors, (726), 51 states have call successors, (51), 8 states have call predecessors, (51), 8 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 01:11:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 828 transitions. [2025-03-04 01:11:41,079 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 828 transitions. Word has length 154 [2025-03-04 01:11:41,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:41,080 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 828 transitions. [2025-03-04 01:11:41,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-04 01:11:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 828 transitions. [2025-03-04 01:11:41,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:11:41,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:41,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:41,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:11:41,081 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:41,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:41,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1548993052, now seen corresponding path program 1 times [2025-03-04 01:11:41,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:41,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272993786] [2025-03-04 01:11:41,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:41,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:41,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:11:41,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:11:41,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:41,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:41,695 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-04 01:11:41,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:41,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272993786] [2025-03-04 01:11:41,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272993786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:41,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:41,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:11:41,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072106982] [2025-03-04 01:11:41,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:41,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:11:41,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:41,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:11:41,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:41,698 INFO L87 Difference]: Start difference. First operand 599 states and 828 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 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-04 01:11:41,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:41,851 INFO L93 Difference]: Finished difference Result 621 states and 851 transitions. [2025-03-04 01:11:41,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:11:41,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 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 154 [2025-03-04 01:11:41,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:41,855 INFO L225 Difference]: With dead ends: 621 [2025-03-04 01:11:41,856 INFO L226 Difference]: Without dead ends: 619 [2025-03-04 01:11:41,856 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-04 01:11:41,857 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 87 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:41,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1047 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:41,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-03-04 01:11:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2025-03-04 01:11:41,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 557 states have (on average 1.3357271095152603) internal successors, (744), 560 states have internal predecessors, (744), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-04 01:11:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 846 transitions. [2025-03-04 01:11:41,890 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 846 transitions. Word has length 154 [2025-03-04 01:11:41,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:41,890 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 846 transitions. [2025-03-04 01:11:41,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 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-04 01:11:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 846 transitions. [2025-03-04 01:11:41,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:11:41,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:41,892 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:41,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:11:41,893 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:41,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:41,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1549916573, now seen corresponding path program 1 times [2025-03-04 01:11:41,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:41,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761282900] [2025-03-04 01:11:41,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:41,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:41,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:11:41,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:11:41,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:41,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:11:42,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:42,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761282900] [2025-03-04 01:11:42,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761282900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:11:42,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888100609] [2025-03-04 01:11:42,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:42,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:42,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:42,538 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-04 01:11:42,540 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-04 01:11:42,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:11:42,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:11:42,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:42,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:42,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 01:11:42,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:42,845 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 27 treesize of output 15 [2025-03-04 01:11:42,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-04 01:11:42,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 01:11:43,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 01:11:43,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-04 01:11:43,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:11:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 232 proven. 12 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-04 01:11:43,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:11:43,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2025-03-04 01:11:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:11:43,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888100609] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:11:43,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:11:43,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 20 [2025-03-04 01:11:43,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130824660] [2025-03-04 01:11:43,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:11:43,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 01:11:43,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:43,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 01:11:43,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:11:43,551 INFO L87 Difference]: Start difference. First operand 619 states and 846 transitions. Second operand has 20 states, 16 states have (on average 8.8125) internal successors, (141), 20 states have internal predecessors, (141), 9 states have call successors, (51), 3 states have call predecessors, (51), 6 states have return successors, (51), 5 states have call predecessors, (51), 9 states have call successors, (51) [2025-03-04 01:11:44,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:44,259 INFO L93 Difference]: Finished difference Result 1705 states and 2311 transitions. [2025-03-04 01:11:44,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 01:11:44,260 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 8.8125) internal successors, (141), 20 states have internal predecessors, (141), 9 states have call successors, (51), 3 states have call predecessors, (51), 6 states have return successors, (51), 5 states have call predecessors, (51), 9 states have call successors, (51) Word has length 154 [2025-03-04 01:11:44,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:44,265 INFO L225 Difference]: With dead ends: 1705 [2025-03-04 01:11:44,265 INFO L226 Difference]: Without dead ends: 1144 [2025-03-04 01:11:44,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 302 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:11:44,267 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 316 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:44,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 893 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:11:44,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2025-03-04 01:11:44,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1070. [2025-03-04 01:11:44,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 966 states have (on average 1.3250517598343685) internal successors, (1280), 972 states have internal predecessors, (1280), 83 states have call successors, (83), 20 states have call predecessors, (83), 20 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-04 01:11:44,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1446 transitions. [2025-03-04 01:11:44,324 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1446 transitions. Word has length 154 [2025-03-04 01:11:44,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:44,325 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1446 transitions. [2025-03-04 01:11:44,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 8.8125) internal successors, (141), 20 states have internal predecessors, (141), 9 states have call successors, (51), 3 states have call predecessors, (51), 6 states have return successors, (51), 5 states have call predecessors, (51), 9 states have call successors, (51) [2025-03-04 01:11:44,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1446 transitions. [2025-03-04 01:11:44,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:11:44,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:44,327 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:44,334 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-04 01:11:44,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 01:11:44,527 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:44,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:44,528 INFO L85 PathProgramCache]: Analyzing trace with hash 762612849, now seen corresponding path program 1 times [2025-03-04 01:11:44,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:44,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248628607] [2025-03-04 01:11:44,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:44,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:44,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:11:44,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:11:44,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:44,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:44,859 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-04 01:11:44,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:44,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248628607] [2025-03-04 01:11:44,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248628607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:44,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:44,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:11:44,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917093800] [2025-03-04 01:11:44,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:44,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:11:44,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:44,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:11:44,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:44,861 INFO L87 Difference]: Start difference. First operand 1070 states and 1446 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 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-04 01:11:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:44,978 INFO L93 Difference]: Finished difference Result 1730 states and 2340 transitions. [2025-03-04 01:11:44,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:11:44,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 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 155 [2025-03-04 01:11:44,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:44,983 INFO L225 Difference]: With dead ends: 1730 [2025-03-04 01:11:44,984 INFO L226 Difference]: Without dead ends: 1169 [2025-03-04 01:11:44,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:44,985 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 160 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:44,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 802 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:44,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2025-03-04 01:11:45,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1072. [2025-03-04 01:11:45,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 968 states have (on average 1.3243801652892562) internal successors, (1282), 974 states have internal predecessors, (1282), 83 states have call successors, (83), 20 states have call predecessors, (83), 20 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-04 01:11:45,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1448 transitions. [2025-03-04 01:11:45,031 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1448 transitions. Word has length 155 [2025-03-04 01:11:45,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:45,032 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1448 transitions. [2025-03-04 01:11:45,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 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-04 01:11:45,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1448 transitions. [2025-03-04 01:11:45,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:11:45,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:45,034 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:45,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:11:45,034 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:45,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:45,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1275443440, now seen corresponding path program 1 times [2025-03-04 01:11:45,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:45,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131716566] [2025-03-04 01:11:45,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:45,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:45,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:11:45,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:11:45,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:45,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:45,259 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-04 01:11:45,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:45,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131716566] [2025-03-04 01:11:45,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131716566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:45,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:45,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:11:45,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132946775] [2025-03-04 01:11:45,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:45,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:11:45,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:45,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:11:45,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:11:45,261 INFO L87 Difference]: Start difference. First operand 1072 states and 1448 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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-04 01:11:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:45,425 INFO L93 Difference]: Finished difference Result 2373 states and 3202 transitions. [2025-03-04 01:11:45,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:11:45,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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 155 [2025-03-04 01:11:45,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:45,431 INFO L225 Difference]: With dead ends: 2373 [2025-03-04 01:11:45,431 INFO L226 Difference]: Without dead ends: 1363 [2025-03-04 01:11:45,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:11:45,433 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 148 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:45,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1074 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:45,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2025-03-04 01:11:45,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1155. [2025-03-04 01:11:45,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1051 states have (on average 1.3206470028544244) internal successors, (1388), 1057 states have internal predecessors, (1388), 83 states have call successors, (83), 20 states have call predecessors, (83), 20 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-04 01:11:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1554 transitions. [2025-03-04 01:11:45,479 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1554 transitions. Word has length 155 [2025-03-04 01:11:45,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:45,479 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1554 transitions. [2025-03-04 01:11:45,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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-04 01:11:45,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1554 transitions. [2025-03-04 01:11:45,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:11:45,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:45,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:45,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:11:45,481 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:45,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:45,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1722838593, now seen corresponding path program 1 times [2025-03-04 01:11:45,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:45,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858364706] [2025-03-04 01:11:45,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:45,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:45,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:11:45,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:11:45,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:45,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:46,100 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-04 01:11:46,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:46,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858364706] [2025-03-04 01:11:46,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858364706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:46,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:46,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:11:46,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228121451] [2025-03-04 01:11:46,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:46,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:11:46,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:46,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:11:46,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:11:46,101 INFO L87 Difference]: Start difference. First operand 1155 states and 1554 transitions. Second operand has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 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-04 01:11:46,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:46,613 INFO L93 Difference]: Finished difference Result 2609 states and 3505 transitions. [2025-03-04 01:11:46,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:11:46,614 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 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 156 [2025-03-04 01:11:46,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:46,619 INFO L225 Difference]: With dead ends: 2609 [2025-03-04 01:11:46,620 INFO L226 Difference]: Without dead ends: 1599 [2025-03-04 01:11:46,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:11:46,622 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 250 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:46,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 766 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:11:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2025-03-04 01:11:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1366. [2025-03-04 01:11:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1261 states have (on average 1.3259318001586042) internal successors, (1672), 1267 states have internal predecessors, (1672), 83 states have call successors, (83), 21 states have call predecessors, (83), 21 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-04 01:11:46,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1838 transitions. [2025-03-04 01:11:46,675 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1838 transitions. Word has length 156 [2025-03-04 01:11:46,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:46,676 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 1838 transitions. [2025-03-04 01:11:46,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 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-04 01:11:46,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1838 transitions. [2025-03-04 01:11:46,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:11:46,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:46,678 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:46,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:11:46,678 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:46,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:46,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2642304, now seen corresponding path program 1 times [2025-03-04 01:11:46,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:46,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879987935] [2025-03-04 01:11:46,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:46,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:46,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:11:46,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:11:46,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:46,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:46,886 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-04 01:11:46,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:46,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879987935] [2025-03-04 01:11:46,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879987935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:46,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:46,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:11:46,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346620059] [2025-03-04 01:11:46,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:46,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:11:46,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:46,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:11:46,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:11:46,888 INFO L87 Difference]: Start difference. First operand 1366 states and 1838 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-04 01:11:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:47,053 INFO L93 Difference]: Finished difference Result 2307 states and 3121 transitions. [2025-03-04 01:11:47,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:11:47,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 156 [2025-03-04 01:11:47,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:47,058 INFO L225 Difference]: With dead ends: 2307 [2025-03-04 01:11:47,058 INFO L226 Difference]: Without dead ends: 1090 [2025-03-04 01:11:47,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:11:47,061 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 108 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:47,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 391 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:47,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2025-03-04 01:11:47,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1058. [2025-03-04 01:11:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 969 states have (on average 1.3188854489164086) internal successors, (1278), 973 states have internal predecessors, (1278), 70 states have call successors, (70), 18 states have call predecessors, (70), 18 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-04 01:11:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1418 transitions. [2025-03-04 01:11:47,102 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1418 transitions. Word has length 156 [2025-03-04 01:11:47,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:47,103 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1418 transitions. [2025-03-04 01:11:47,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-04 01:11:47,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1418 transitions. [2025-03-04 01:11:47,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:11:47,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:47,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:47,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:11:47,104 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:47,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:47,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1273779391, now seen corresponding path program 1 times [2025-03-04 01:11:47,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:47,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851999503] [2025-03-04 01:11:47,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:47,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:47,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:11:47,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:11:47,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:47,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:47,342 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-04 01:11:47,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:47,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851999503] [2025-03-04 01:11:47,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851999503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:47,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:47,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:11:47,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953251358] [2025-03-04 01:11:47,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:47,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:11:47,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:47,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:11:47,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:47,343 INFO L87 Difference]: Start difference. First operand 1058 states and 1418 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 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-04 01:11:47,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:47,440 INFO L93 Difference]: Finished difference Result 1713 states and 2302 transitions. [2025-03-04 01:11:47,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:11:47,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 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 156 [2025-03-04 01:11:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:47,444 INFO L225 Difference]: With dead ends: 1713 [2025-03-04 01:11:47,444 INFO L226 Difference]: Without dead ends: 1124 [2025-03-04 01:11:47,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:47,446 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 170 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:47,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 638 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:47,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2025-03-04 01:11:47,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1026. [2025-03-04 01:11:47,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 937 states have (on average 1.3116328708644611) internal successors, (1229), 941 states have internal predecessors, (1229), 70 states have call successors, (70), 18 states have call predecessors, (70), 18 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-04 01:11:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1369 transitions. [2025-03-04 01:11:47,482 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1369 transitions. Word has length 156 [2025-03-04 01:11:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:47,482 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1369 transitions. [2025-03-04 01:11:47,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 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-04 01:11:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1369 transitions. [2025-03-04 01:11:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:11:47,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:47,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:47,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:11:47,484 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:47,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:47,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1775810128, now seen corresponding path program 1 times [2025-03-04 01:11:47,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:47,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593791790] [2025-03-04 01:11:47,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:47,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:47,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:11:47,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:11:47,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:47,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:48,659 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-04 01:11:48,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:48,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593791790] [2025-03-04 01:11:48,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593791790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:48,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:48,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:11:48,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115015386] [2025-03-04 01:11:48,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:48,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:11:48,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:48,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:11:48,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:11:48,661 INFO L87 Difference]: Start difference. First operand 1026 states and 1369 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:11:49,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:49,418 INFO L93 Difference]: Finished difference Result 2016 states and 2707 transitions. [2025-03-04 01:11:49,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:11:49,419 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 158 [2025-03-04 01:11:49,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:49,423 INFO L225 Difference]: With dead ends: 2016 [2025-03-04 01:11:49,424 INFO L226 Difference]: Without dead ends: 1459 [2025-03-04 01:11:49,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:11:49,426 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 243 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:49,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1453 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:11:49,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2025-03-04 01:11:49,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1211. [2025-03-04 01:11:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 1122 states have (on average 1.3262032085561497) internal successors, (1488), 1126 states have internal predecessors, (1488), 70 states have call successors, (70), 18 states have call predecessors, (70), 18 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-04 01:11:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1628 transitions. [2025-03-04 01:11:49,469 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1628 transitions. Word has length 158 [2025-03-04 01:11:49,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:49,469 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1628 transitions. [2025-03-04 01:11:49,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:11:49,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1628 transitions. [2025-03-04 01:11:49,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:11:49,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:49,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:11:49,471 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:49,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:49,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1165847471, now seen corresponding path program 1 times [2025-03-04 01:11:49,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:49,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735952260] [2025-03-04 01:11:49,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:49,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:49,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:11:49,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:11:49,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:49,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:49,808 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-04 01:11:49,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:49,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735952260] [2025-03-04 01:11:49,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735952260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:49,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:49,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:11:49,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566978389] [2025-03-04 01:11:49,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:49,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:11:49,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:49,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:11:49,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:11:49,810 INFO L87 Difference]: Start difference. First operand 1211 states and 1628 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-04 01:11:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:49,969 INFO L93 Difference]: Finished difference Result 2140 states and 2887 transitions. [2025-03-04 01:11:49,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:11:49,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 158 [2025-03-04 01:11:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:49,974 INFO L225 Difference]: With dead ends: 2140 [2025-03-04 01:11:49,974 INFO L226 Difference]: Without dead ends: 1423 [2025-03-04 01:11:49,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-04 01:11:49,976 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 87 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:49,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 790 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2025-03-04 01:11:50,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1419. [2025-03-04 01:11:50,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1312 states have (on average 1.3140243902439024) internal successors, (1724), 1320 states have internal predecessors, (1724), 84 states have call successors, (84), 22 states have call predecessors, (84), 22 states have return successors, (84), 76 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-04 01:11:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1892 transitions. [2025-03-04 01:11:50,028 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1892 transitions. Word has length 158 [2025-03-04 01:11:50,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:50,029 INFO L471 AbstractCegarLoop]: Abstraction has 1419 states and 1892 transitions. [2025-03-04 01:11:50,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-04 01:11:50,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1892 transitions. [2025-03-04 01:11:50,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:11:50,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:50,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:50,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:11:50,031 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:50,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:50,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2105575889, now seen corresponding path program 1 times [2025-03-04 01:11:50,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:50,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709957095] [2025-03-04 01:11:50,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:50,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:50,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:11:50,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:11:50,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:50,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:50,373 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-04 01:11:50,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:50,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709957095] [2025-03-04 01:11:50,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709957095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:50,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:50,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:11:50,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684825120] [2025-03-04 01:11:50,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:50,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:11:50,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:50,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:11:50,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:11:50,375 INFO L87 Difference]: Start difference. First operand 1419 states and 1892 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-04 01:11:50,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:50,543 INFO L93 Difference]: Finished difference Result 2642 states and 3536 transitions. [2025-03-04 01:11:50,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:11:50,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 158 [2025-03-04 01:11:50,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:50,549 INFO L225 Difference]: With dead ends: 2642 [2025-03-04 01:11:50,549 INFO L226 Difference]: Without dead ends: 1717 [2025-03-04 01:11:50,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-04 01:11:50,552 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 90 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:50,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 676 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:50,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2025-03-04 01:11:50,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1505. [2025-03-04 01:11:50,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1397 states have (on average 1.3178239083750896) internal successors, (1841), 1405 states have internal predecessors, (1841), 84 states have call successors, (84), 23 states have call predecessors, (84), 23 states have return successors, (84), 76 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-04 01:11:50,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2009 transitions. [2025-03-04 01:11:50,613 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2009 transitions. Word has length 158 [2025-03-04 01:11:50,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:50,614 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2009 transitions. [2025-03-04 01:11:50,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-04 01:11:50,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2009 transitions. [2025-03-04 01:11:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:11:50,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:50,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:11:50,616 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:50,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:50,617 INFO L85 PathProgramCache]: Analyzing trace with hash -836081710, now seen corresponding path program 1 times [2025-03-04 01:11:50,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:50,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121415653] [2025-03-04 01:11:50,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:50,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:50,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:11:50,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:11:50,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:50,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 51 proven. 39 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-03-04 01:11:52,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:52,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121415653] [2025-03-04 01:11:52,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121415653] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:11:52,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595639908] [2025-03-04 01:11:52,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:52,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:52,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:52,411 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-04 01:11:52,413 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-04 01:11:52,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:11:52,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:11:52,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:52,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:52,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 01:11:52,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:52,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:11:52,643 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-04 01:11:52,671 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 73 treesize of output 45 [2025-03-04 01:11:52,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:52,918 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 32 [2025-03-04 01:11:52,978 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-04 01:11:52,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:52,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595639908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:52,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:11:52,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [25] total 29 [2025-03-04 01:11:52,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344024758] [2025-03-04 01:11:52,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:52,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:11:52,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:52,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:11:52,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:11:52,980 INFO L87 Difference]: Start difference. First operand 1505 states and 2009 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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-04 01:11:53,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:53,337 INFO L93 Difference]: Finished difference Result 2736 states and 3658 transitions. [2025-03-04 01:11:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:11:53,338 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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 158 [2025-03-04 01:11:53,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:53,343 INFO L225 Difference]: With dead ends: 2736 [2025-03-04 01:11:53,343 INFO L226 Difference]: Without dead ends: 1729 [2025-03-04 01:11:53,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 01:11:53,345 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 87 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:53,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1533 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:11:53,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2025-03-04 01:11:53,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1489. [2025-03-04 01:11:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 1381 states have (on average 1.3186097031136856) internal successors, (1821), 1389 states have internal predecessors, (1821), 84 states have call successors, (84), 23 states have call predecessors, (84), 23 states have return successors, (84), 76 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-04 01:11:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1989 transitions. [2025-03-04 01:11:53,398 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 1989 transitions. Word has length 158 [2025-03-04 01:11:53,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:53,398 INFO L471 AbstractCegarLoop]: Abstraction has 1489 states and 1989 transitions. [2025-03-04 01:11:53,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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-04 01:11:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1989 transitions. [2025-03-04 01:11:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:11:53,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:53,399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:53,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 01:11:53,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 01:11:53,600 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:53,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:53,601 INFO L85 PathProgramCache]: Analyzing trace with hash 857276487, now seen corresponding path program 1 times [2025-03-04 01:11:53,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:53,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450648776] [2025-03-04 01:11:53,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:53,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:53,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:11:53,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:11:53,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:53,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:53,916 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-04 01:11:53,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:53,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450648776] [2025-03-04 01:11:53,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450648776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:53,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:53,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:11:53,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597099081] [2025-03-04 01:11:53,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:53,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:11:53,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:53,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:11:53,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:11:53,917 INFO L87 Difference]: Start difference. First operand 1489 states and 1989 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-04 01:11:54,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:54,352 INFO L93 Difference]: Finished difference Result 3433 states and 4588 transitions. [2025-03-04 01:11:54,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:11:54,352 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 158 [2025-03-04 01:11:54,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:54,360 INFO L225 Difference]: With dead ends: 3433 [2025-03-04 01:11:54,360 INFO L226 Difference]: Without dead ends: 2096 [2025-03-04 01:11:54,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:11:54,363 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 373 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:54,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 864 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:11:54,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2025-03-04 01:11:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 1917. [2025-03-04 01:11:54,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1917 states, 1776 states have (on average 1.302927927927928) internal successors, (2314), 1788 states have internal predecessors, (2314), 110 states have call successors, (110), 30 states have call predecessors, (110), 30 states have return successors, (110), 98 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-04 01:11:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 2534 transitions. [2025-03-04 01:11:54,431 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 2534 transitions. Word has length 158 [2025-03-04 01:11:54,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:54,431 INFO L471 AbstractCegarLoop]: Abstraction has 1917 states and 2534 transitions. [2025-03-04 01:11:54,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-04 01:11:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2534 transitions. [2025-03-04 01:11:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:11:54,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:54,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:54,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:11:54,433 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:54,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:54,433 INFO L85 PathProgramCache]: Analyzing trace with hash 940748103, now seen corresponding path program 1 times [2025-03-04 01:11:54,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:54,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977302283] [2025-03-04 01:11:54,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:54,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:54,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:11:54,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:11:54,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:54,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:54,568 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-04 01:11:54,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:54,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977302283] [2025-03-04 01:11:54,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977302283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:54,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:54,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:11:54,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654814262] [2025-03-04 01:11:54,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:54,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:11:54,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:54,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:11:54,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:11:54,569 INFO L87 Difference]: Start difference. First operand 1917 states and 2534 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-04 01:11:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:54,747 INFO L93 Difference]: Finished difference Result 3791 states and 5029 transitions. [2025-03-04 01:11:54,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:11:54,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 158 [2025-03-04 01:11:54,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:54,753 INFO L225 Difference]: With dead ends: 3791 [2025-03-04 01:11:54,753 INFO L226 Difference]: Without dead ends: 2044 [2025-03-04 01:11:54,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:54,756 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 199 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:54,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 555 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:54,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2025-03-04 01:11:54,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 1881. [2025-03-04 01:11:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1881 states, 1740 states have (on average 1.297126436781609) internal successors, (2257), 1752 states have internal predecessors, (2257), 110 states have call successors, (110), 30 states have call predecessors, (110), 30 states have return successors, (110), 98 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-04 01:11:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2477 transitions. [2025-03-04 01:11:54,825 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2477 transitions. Word has length 158 [2025-03-04 01:11:54,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:54,825 INFO L471 AbstractCegarLoop]: Abstraction has 1881 states and 2477 transitions. [2025-03-04 01:11:54,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-04 01:11:54,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2477 transitions. [2025-03-04 01:11:54,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 01:11:54,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:54,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:54,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 01:11:54,827 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:54,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:54,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1922255935, now seen corresponding path program 1 times [2025-03-04 01:11:54,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:54,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928370527] [2025-03-04 01:11:54,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:54,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:54,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:11:54,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:11:54,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:54,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:11:54,881 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:11:54,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 01:11:55,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 01:11:55,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:55,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:11:55,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:11:55,068 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:11:55,069 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:11:55,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 01:11:55,072 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:55,191 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:11:55,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:11:55 BoogieIcfgContainer [2025-03-04 01:11:55,194 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:11:55,195 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:11:55,195 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:11:55,195 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:11:55,211 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:11:32" (3/4) ... [2025-03-04 01:11:55,213 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:11:55,214 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:11:55,215 INFO L158 Benchmark]: Toolchain (without parser) took 24197.96ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 113.7MB in the beginning and 72.3MB in the end (delta: 41.4MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. [2025-03-04 01:11:55,215 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:11:55,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.93ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 97.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:11:55,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.10ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 94.4MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:11:55,216 INFO L158 Benchmark]: Boogie Preprocessor took 61.69ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 90.0MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:11:55,216 INFO L158 Benchmark]: IcfgBuilder took 705.36ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 54.0MB in the end (delta: 36.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:11:55,216 INFO L158 Benchmark]: TraceAbstraction took 23165.11ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 53.0MB in the beginning and 72.4MB in the end (delta: -19.4MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2025-03-04 01:11:55,217 INFO L158 Benchmark]: Witness Printer took 19.48ms. Allocated memory is still 167.8MB. Free memory was 72.4MB in the beginning and 72.3MB in the end (delta: 162.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:11:55,218 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.20ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.93ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 97.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.10ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 94.4MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.69ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 90.0MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 705.36ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 54.0MB in the end (delta: 36.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 23165.11ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 53.0MB in the beginning and 72.4MB in the end (delta: -19.4MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Witness Printer took 19.48ms. Allocated memory is still 167.8MB. Free memory was 72.4MB in the beginning and 72.3MB in the end (delta: 162.2kB). 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 82, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of bitwiseOr at line 49, overapproximation of bitwiseOr at line 108. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25-L27] float float_Array_0[2] = { 1000000.5, 4.5 }; [L25-L27] float float_Array_0[2] = { 1000000.5, 4.5 }; [L25-L27] float float_Array_0[2] = { 1000000.5, 4.5 }; [L28-L30] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 64 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 64 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { -16 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { -16 }; [L37-L39] unsigned char unsigned_char_Array_0[2] = { 0, 128 }; [L37-L39] unsigned char unsigned_char_Array_0[2] = { 0, 128 }; [L37-L39] unsigned char unsigned_char_Array_0[2] = { 0, 128 }; [L40-L42] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L40-L42] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L40-L42] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L40-L42] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L40-L42] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L43] signed short int last_1_signed_short_int_Array_0_0_ = -16; [L44] unsigned char last_1_unsigned_char_Array_0_0_ = 0; [L45] unsigned long int last_1_unsigned_long_int_Array_0_0__1_ = 25; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] CALL updateLastVariables() [L103] EXPR signed_short_int_Array_0[0] [L103] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L104] EXPR unsigned_char_Array_0[0] [L104] last_1_unsigned_char_Array_0_0_ = unsigned_char_Array_0[0] [L105] EXPR unsigned_long_int_Array_0[0][1] [L105] last_1_unsigned_long_int_Array_0_0__1_ = unsigned_long_int_Array_0[0][1] [L115] RET updateLastVariables() [L116] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L78] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L80] 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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L80] 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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L81] float_Array_0[1] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[1] [L82] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L82] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L82] EXPR float_Array_0[1] [L82] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L82] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L82] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L82] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L82] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L83] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L84] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[0][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L85] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L86] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L87] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L88] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L89] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L90] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L91] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L92] unsigned_long_int_Array_0[0][0] = __VERIFIER_nondet_ulong() [L93] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L93] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L93] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L94] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L94] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L94] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L95] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L96] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L96] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L96] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L97] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L97] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L97] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L98] unsigned_long_int_Array_0[1][1] = __VERIFIER_nondet_ulong() [L99] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L99] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L99] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L100] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L100] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L100] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L116] RET updateVariables() [L117] CALL step() [L49] EXPR last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_ VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L49] ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L49] ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] [L49] EXPR BOOL_unsigned_char_Array_0[1] [L49] ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L49] COND FALSE !(((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) [L56] EXPR signed_char_Array_0[0][1] [L56] signed_char_Array_0[1][1] = signed_char_Array_0[0][1] [L58] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L58] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L61] EXPR unsigned_long_int_Array_0[0][0] [L61] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L61] COND TRUE unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0] [L62] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L62] EXPR ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]) [L62] EXPR signed_char_Array_0[1][0] [L62] EXPR ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L62] signed_long_int_Array_0[0] = ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))) [L64] signed_short_int_Array_0[0] = 2 [L65] EXPR float_Array_0[1] [L65] float_Array_0[0] = float_Array_0[1] [L66] EXPR unsigned_char_Array_0[1] [L66] unsigned_char_Array_0[0] = unsigned_char_Array_0[1] [L67] EXPR signed_char_Array_0[1][0] [L67] EXPR signed_char_Array_0[1][1] [L67] unsigned char stepLocal_0 = signed_char_Array_0[1][0] < signed_char_Array_0[1][1]; [L68] stepLocal_0 && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L68] stepLocal_0 && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L68] COND FALSE !(stepLocal_0 && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) [L71] EXPR unsigned_long_int_Array_0[1][1] [L71] EXPR unsigned_long_int_Array_0[1][0] [L71] unsigned_long_int_Array_0[0][1] = (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]) [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_ VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] [L108] EXPR BOOL_unsigned_char_Array_0[1] [L108] EXPR ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) [L108] EXPR signed_char_Array_0[1][1] [L108] EXPR signed_char_Array_0[0][1] [L108] EXPR (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1) [L108] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1 [L108] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))) [L108] EXPR signed_char_Array_0[1][0] [L108] EXPR signed_char_Array_0[1][1] [L108] EXPR (signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))) [L108] EXPR unsigned_long_int_Array_0[0][1] [L108] EXPR unsigned_long_int_Array_0[1][1] [L108] EXPR unsigned_long_int_Array_0[1][0] [L108] EXPR ((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1) [L108] EXPR unsigned_long_int_Array_0[0][0] [L108] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1 [L108] EXPR signed_long_int_Array_0[0] [L108] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]) [L108] EXPR signed_char_Array_0[1][0] [L108] EXPR ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2)) [L108] EXPR signed_short_int_Array_0[0] [L108] EXPR (((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1])) [L108] EXPR float_Array_0[0] [L108] EXPR float_Array_0[1] [L108] EXPR ((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108-L109] return (((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) ; [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.0s, OverallIterations: 30, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3164 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3142 mSDsluCounter, 20628 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15406 mSDsCounter, 430 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4890 IncrementalHoareTripleChecker+Invalid, 5320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 430 mSolverCounterUnsat, 5222 mSDtfsCounter, 4890 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1056 GetRequests, 855 SyntacticMatches, 3 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1917occurred in iteration=28, InterpolantAutomatonStates: 176, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 29 MinimizatonAttempts, 2024 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 5159 NumberOfCodeBlocks, 5159 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 5121 ConstructedInterpolants, 0 QuantifiedInterpolants, 23393 SizeOfPredicates, 11 NumberOfNonLiveVariables, 2120 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 34 InterpolantComputations, 28 PerfectInterpolantSequences, 18341/18496 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-04 01:11:55,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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-88.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 ee043a380462a1c76ab3130ca5e702431f3ce27542f408d77a3f5f81e3836d71 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:11:56,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:11:57,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:11:57,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:11:57,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:11:57,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:11:57,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:11:57,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:11:57,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:11:57,092 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:11:57,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:11:57,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:11:57,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:11:57,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:11:57,094 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:11:57,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:11:57,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:11:57,094 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:11:57,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:11:57,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:11:57,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:11:57,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:11:57,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:11:57,095 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:11:57,095 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:11:57,095 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:11:57,095 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:11:57,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:11:57,095 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:11:57,095 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:11:57,095 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:11:57,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:11:57,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:11:57,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:11:57,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:11:57,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:11:57,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:11:57,096 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:11:57,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:11:57,096 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:11:57,097 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:11:57,097 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:11:57,097 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:11:57,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:11:57,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:11:57,097 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 -> ee043a380462a1c76ab3130ca5e702431f3ce27542f408d77a3f5f81e3836d71 [2025-03-04 01:11:57,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:11:57,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:11:57,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:11:57,350 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:11:57,350 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:11:57,351 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-88.i [2025-03-04 01:11:58,480 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/220d1dd72/12757d7cf80e41d3bf498d59cb91ce31/FLAG0079cd182 [2025-03-04 01:11:58,669 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:11:58,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i [2025-03-04 01:11:58,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/220d1dd72/12757d7cf80e41d3bf498d59cb91ce31/FLAG0079cd182 [2025-03-04 01:11:59,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/220d1dd72/12757d7cf80e41d3bf498d59cb91ce31 [2025-03-04 01:11:59,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:11:59,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:11:59,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:11:59,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:11:59,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:11:59,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:11:59" (1/1) ... [2025-03-04 01:11:59,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e27440c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:59, skipping insertion in model container [2025-03-04 01:11:59,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:11:59" (1/1) ... [2025-03-04 01:11:59,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:11:59,148 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-88.i[916,929] [2025-03-04 01:11:59,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:11:59,202 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:11:59,209 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-88.i[916,929] [2025-03-04 01:11:59,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:11:59,265 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:11:59,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:59 WrapperNode [2025-03-04 01:11:59,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:11:59,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:11:59,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:11:59,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:11:59,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:59" (1/1) ... [2025-03-04 01:11:59,289 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:59" (1/1) ... [2025-03-04 01:11:59,322 INFO L138 Inliner]: procedures = 36, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 508 [2025-03-04 01:11:59,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:11:59,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:11:59,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:11:59,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:11:59,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:59" (1/1) ... [2025-03-04 01:11:59,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:59" (1/1) ... [2025-03-04 01:11:59,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:59" (1/1) ... [2025-03-04 01:11:59,357 INFO L175 MemorySlicer]: Split 134 memory accesses to 8 slices as follows [2, 16, 11, 54, 3, 4, 10, 34]. 40 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 2, 4, 1, 1, 2, 4]. The 19 writes are split as follows [0, 2, 2, 6, 1, 1, 2, 5]. [2025-03-04 01:11:59,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:59" (1/1) ... [2025-03-04 01:11:59,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:59" (1/1) ... [2025-03-04 01:11:59,379 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:59" (1/1) ... [2025-03-04 01:11:59,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:59" (1/1) ... [2025-03-04 01:11:59,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:59" (1/1) ... [2025-03-04 01:11:59,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:59" (1/1) ... [2025-03-04 01:11:59,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:11:59,401 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:11:59,401 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:11:59,401 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:11:59,402 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:59" (1/1) ... [2025-03-04 01:11:59,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:11:59,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:59,426 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-04 01:11:59,430 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-04 01:11:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:11:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:11:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:11:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:11:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:11:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:11:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 01:11:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-04 01:11:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-04 01:11:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 01:11:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 01:11:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 01:11:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-04 01:11:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-04 01:11:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-04 01:11:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-04 01:11:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-03-04 01:11:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:11:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:11:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:11:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:11:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:11:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 01:11:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-04 01:11:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-04 01:11:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-04 01:11:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:11:59,448 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:11:59,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-04 01:11:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-04 01:11:59,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-04 01:11:59,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-04 01:11:59,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-03-04 01:11:59,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:11:59,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:11:59,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 01:11:59,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 01:11:59,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 01:11:59,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-04 01:11:59,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-04 01:11:59,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-04 01:11:59,584 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:11:59,586 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:11:59,977 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc property_#t~mem78#1;havoc property_#t~short79#1;havoc property_#t~ite90#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~short82#1;havoc property_#t~ite87#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~ite98#1;havoc property_#t~mem97#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short99#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem107#1;havoc property_#t~short108#1;havoc property_#t~ite119#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite113#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem123#1;havoc property_#t~ite126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short129#1;havoc property_#t~mem130#1;havoc property_#t~short131#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1; [2025-03-04 01:12:00,012 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-03-04 01:12:00,012 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:12:00,027 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:12:00,027 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:12:00,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:12:00 BoogieIcfgContainer [2025-03-04 01:12:00,027 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:12:00,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:12:00,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:12:00,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:12:00,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:11:59" (1/3) ... [2025-03-04 01:12:00,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6868ba64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:12:00, skipping insertion in model container [2025-03-04 01:12:00,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:59" (2/3) ... [2025-03-04 01:12:00,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6868ba64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:12:00, skipping insertion in model container [2025-03-04 01:12:00,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:12:00" (3/3) ... [2025-03-04 01:12:00,035 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-88.i [2025-03-04 01:12:00,045 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:12:00,046 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-88.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:12:00,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:12:00,105 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;@21d6e928, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:12:00,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:12:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 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-04 01:12:00,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:12:00,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:00,116 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-04 01:12:00,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:00,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:00,120 INFO L85 PathProgramCache]: Analyzing trace with hash 357355680, now seen corresponding path program 1 times [2025-03-04 01:12:00,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:00,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485104468] [2025-03-04 01:12:00,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:00,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-04 01:12:00,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:00,131 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-04 01:12:00,132 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-04 01:12:00,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:12:00,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:12:00,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:00,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:00,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:12:00,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:00,423 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-04 01:12:00,423 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:00,423 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:00,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485104468] [2025-03-04 01:12:00,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485104468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:00,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:00,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:12:00,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181522159] [2025-03-04 01:12:00,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:00,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:12:00,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:00,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:12:00,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:12:00,442 INFO L87 Difference]: Start difference. First operand has 110 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 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 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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-04 01:12:00,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:00,468 INFO L93 Difference]: Finished difference Result 214 states and 334 transitions. [2025-03-04 01:12:00,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:12:00,471 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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-04 01:12:00,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:00,476 INFO L225 Difference]: With dead ends: 214 [2025-03-04 01:12:00,476 INFO L226 Difference]: Without dead ends: 107 [2025-03-04 01:12:00,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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-04 01:12:00,480 INFO L435 NwaCegarLoop]: 156 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, 156 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-04 01:12:00,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:12:00,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-04 01:12:00,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-04 01:12:00,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 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-04 01:12:00,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2025-03-04 01:12:00,513 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 139 [2025-03-04 01:12:00,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:00,513 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2025-03-04 01:12:00,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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-04 01:12:00,514 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2025-03-04 01:12:00,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:12:00,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:00,516 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-04 01:12:00,522 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-04 01:12:00,717 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-04 01:12:00,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:00,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:00,718 INFO L85 PathProgramCache]: Analyzing trace with hash -431435991, now seen corresponding path program 1 times [2025-03-04 01:12:00,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:00,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747196381] [2025-03-04 01:12:00,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:00,719 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-04 01:12:00,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:00,721 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-04 01:12:00,723 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-04 01:12:00,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:12:00,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:12:00,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:00,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:00,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:12:00,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:00,977 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-04 01:12:00,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:00,978 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:00,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747196381] [2025-03-04 01:12:00,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747196381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:00,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:00,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:12:00,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472401148] [2025-03-04 01:12:00,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:00,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:12:00,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:00,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:12:00,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:12:00,980 INFO L87 Difference]: Start difference. First operand 107 states and 156 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-04 01:12:01,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:01,047 INFO L93 Difference]: Finished difference Result 218 states and 319 transitions. [2025-03-04 01:12:01,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:12:01,048 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-04 01:12:01,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:01,050 INFO L225 Difference]: With dead ends: 218 [2025-03-04 01:12:01,050 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 01:12:01,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 134 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-04 01:12:01,051 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:01,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 724 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:12:01,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 01:12:01,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-03-04 01:12:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 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-04 01:12:01,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2025-03-04 01:12:01,062 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 139 [2025-03-04 01:12:01,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:01,063 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2025-03-04 01:12:01,063 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-04 01:12:01,063 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2025-03-04 01:12:01,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:12:01,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:01,064 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-04 01:12:01,070 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-04 01:12:01,266 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-04 01:12:01,267 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:01,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:01,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2056076842, now seen corresponding path program 1 times [2025-03-04 01:12:01,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:01,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58163856] [2025-03-04 01:12:01,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:01,268 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-04 01:12:01,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:01,270 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-04 01:12:01,270 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-04 01:12:01,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:12:01,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:12:01,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:01,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:01,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:12:01,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:01,521 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-04 01:12:01,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:01,521 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:01,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58163856] [2025-03-04 01:12:01,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58163856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:01,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:01,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:12:01,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578275609] [2025-03-04 01:12:01,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:01,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:12:01,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:01,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:12:01,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:12:01,524 INFO L87 Difference]: Start difference. First operand 113 states and 162 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-04 01:12:01,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:01,593 INFO L93 Difference]: Finished difference Result 226 states and 325 transitions. [2025-03-04 01:12:01,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:12:01,593 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-04 01:12:01,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:01,594 INFO L225 Difference]: With dead ends: 226 [2025-03-04 01:12:01,594 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 01:12:01,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:12:01,597 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:01,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 857 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:12:01,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 01:12:01,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-03-04 01:12:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 96 states have internal predecessors, (130), 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-04 01:12:01,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2025-03-04 01:12:01,603 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 139 [2025-03-04 01:12:01,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:01,604 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2025-03-04 01:12:01,604 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-04 01:12:01,604 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2025-03-04 01:12:01,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:12:01,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:01,606 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-04 01:12:01,611 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 (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:12:01,809 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-04 01:12:01,809 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:01,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:01,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1351386773, now seen corresponding path program 1 times [2025-03-04 01:12:01,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:01,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625691149] [2025-03-04 01:12:01,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:01,810 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-04 01:12:01,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:01,812 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-04 01:12:01,813 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-04 01:12:01,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:12:01,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:12:01,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:01,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:01,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:12:01,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:02,030 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-04 01:12:02,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:02,031 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:02,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625691149] [2025-03-04 01:12:02,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625691149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:02,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:02,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:12:02,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552654156] [2025-03-04 01:12:02,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:02,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:12:02,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:02,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:12:02,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:12:02,032 INFO L87 Difference]: Start difference. First operand 115 states and 164 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (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-04 01:12:02,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:02,099 INFO L93 Difference]: Finished difference Result 230 states and 329 transitions. [2025-03-04 01:12:02,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:12:02,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (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-04 01:12:02,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:02,101 INFO L225 Difference]: With dead ends: 230 [2025-03-04 01:12:02,103 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 01:12:02,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 132 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-04 01:12:02,104 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:02,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 992 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:12:02,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 01:12:02,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-04 01:12:02,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.346938775510204) internal successors, (132), 98 states have internal predecessors, (132), 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-04 01:12:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2025-03-04 01:12:02,114 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 139 [2025-03-04 01:12:02,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:02,114 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2025-03-04 01:12:02,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (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-04 01:12:02,115 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2025-03-04 01:12:02,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:12:02,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:02,118 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-04 01:12:02,123 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-04 01:12:02,318 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-04 01:12:02,319 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:02,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:02,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1350463252, now seen corresponding path program 1 times [2025-03-04 01:12:02,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:02,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082381169] [2025-03-04 01:12:02,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:02,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:12:02,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:02,321 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-04 01:12:02,323 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-04 01:12:02,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:12:02,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:12:02,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:02,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:02,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 01:12:02,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:02,632 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 26 treesize of output 14 [2025-03-04 01:12:02,658 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-04 01:12:02,828 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-04 01:12:03,000 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 27 treesize of output 11 [2025-03-04 01:12:03,115 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 27 treesize of output 11 [2025-03-04 01:12:03,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:03,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-03-04 01:12:03,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:03,292 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 31 treesize of output 13 [2025-03-04 01:12:03,296 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 15 treesize of output 7 [2025-03-04 01:12:03,310 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 379 proven. 12 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-04 01:12:03,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:12:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:12:03,633 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:03,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082381169] [2025-03-04 01:12:03,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082381169] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:12:03,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:12:03,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2025-03-04 01:12:03,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142767145] [2025-03-04 01:12:03,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:12:03,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:12:03,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:03,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:12:03,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:12:03,635 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 16 states, 14 states have (on average 7.428571428571429) internal successors, (104), 16 states have internal predecessors, (104), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) [2025-03-04 01:12:04,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:04,838 INFO L93 Difference]: Finished difference Result 353 states and 499 transitions. [2025-03-04 01:12:04,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:12:04,839 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.428571428571429) internal successors, (104), 16 states have internal predecessors, (104), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) Word has length 139 [2025-03-04 01:12:04,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:04,840 INFO L225 Difference]: With dead ends: 353 [2025-03-04 01:12:04,840 INFO L226 Difference]: Without dead ends: 239 [2025-03-04 01:12:04,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:12:04,841 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 560 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:04,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 952 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 01:12:04,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-04 01:12:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 231. [2025-03-04 01:12:04,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 193 states have (on average 1.3419689119170986) internal successors, (259), 193 states have internal predecessors, (259), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:12:04,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 327 transitions. [2025-03-04 01:12:04,868 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 327 transitions. Word has length 139 [2025-03-04 01:12:04,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:04,868 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 327 transitions. [2025-03-04 01:12:04,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.428571428571429) internal successors, (104), 16 states have internal predecessors, (104), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) [2025-03-04 01:12:04,868 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 327 transitions. [2025-03-04 01:12:04,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:12:04,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:04,873 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-04 01:12:04,879 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-04 01:12:05,073 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-04 01:12:05,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:05,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:05,074 INFO L85 PathProgramCache]: Analyzing trace with hash -846246294, now seen corresponding path program 1 times [2025-03-04 01:12:05,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:05,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176763709] [2025-03-04 01:12:05,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:05,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:12:05,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:05,078 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-04 01:12:05,078 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-04 01:12:05,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:12:05,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:12:05,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:05,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:05,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:12:05,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:05,467 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2025-03-04 01:12:05,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:12:05,545 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-04 01:12:05,545 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:05,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176763709] [2025-03-04 01:12:05,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176763709] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:12:05,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:12:05,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-03-04 01:12:05,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23795678] [2025-03-04 01:12:05,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:05,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:12:05,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:05,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:12:05,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:12:05,547 INFO L87 Difference]: Start difference. First operand 231 states and 327 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-04 01:12:05,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:05,623 INFO L93 Difference]: Finished difference Result 489 states and 688 transitions. [2025-03-04 01:12:05,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:12:05,624 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-04 01:12:05,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:05,626 INFO L225 Difference]: With dead ends: 489 [2025-03-04 01:12:05,626 INFO L226 Difference]: Without dead ends: 375 [2025-03-04 01:12:05,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:12:05,627 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 170 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:05,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 426 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:12:05,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-04 01:12:05,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 371. [2025-03-04 01:12:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 327 states have (on average 1.3577981651376148) internal successors, (444), 329 states have internal predecessors, (444), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:12:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 520 transitions. [2025-03-04 01:12:05,642 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 520 transitions. Word has length 141 [2025-03-04 01:12:05,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:05,643 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 520 transitions. [2025-03-04 01:12:05,643 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-04 01:12:05,643 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 520 transitions. [2025-03-04 01:12:05,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:12:05,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:05,644 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-04 01:12:05,650 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 (7)] Forceful destruction successful, exit code 0 [2025-03-04 01:12:05,848 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-04 01:12:05,848 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:05,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:05,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1573925226, now seen corresponding path program 1 times [2025-03-04 01:12:05,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:05,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863362928] [2025-03-04 01:12:05,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:05,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-04 01:12:05,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:05,851 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-04 01:12:05,852 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-04 01:12:05,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:12:06,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:12:06,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:06,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:06,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 01:12:06,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:06,096 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-04 01:12:06,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:06,184 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 38 treesize of output 25 [2025-03-04 01:12:06,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:06,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 45 [2025-03-04 01:12:06,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:06,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 46 [2025-03-04 01:12:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-03-04 01:12:06,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:06,657 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:06,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863362928] [2025-03-04 01:12:06,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863362928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:06,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:06,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:12:06,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607474227] [2025-03-04 01:12:06,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:06,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:12:06,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:06,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:12:06,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:12:06,658 INFO L87 Difference]: Start difference. First operand 371 states and 520 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 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-04 01:12:07,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:07,488 INFO L93 Difference]: Finished difference Result 912 states and 1271 transitions. [2025-03-04 01:12:07,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:12:07,489 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 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 141 [2025-03-04 01:12:07,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:07,493 INFO L225 Difference]: With dead ends: 912 [2025-03-04 01:12:07,494 INFO L226 Difference]: Without dead ends: 544 [2025-03-04 01:12:07,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:12:07,495 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 299 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:07,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 940 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:12:07,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-03-04 01:12:07,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 405. [2025-03-04 01:12:07,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 352 states have (on average 1.3409090909090908) internal successors, (472), 355 states have internal predecessors, (472), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 01:12:07,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 562 transitions. [2025-03-04 01:12:07,525 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 562 transitions. Word has length 141 [2025-03-04 01:12:07,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:07,525 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 562 transitions. [2025-03-04 01:12:07,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 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-04 01:12:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 562 transitions. [2025-03-04 01:12:07,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:12:07,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:07,526 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-04 01:12:07,533 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-04 01:12:07,727 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-04 01:12:07,727 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:07,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:07,728 INFO L85 PathProgramCache]: Analyzing trace with hash -834930167, now seen corresponding path program 1 times [2025-03-04 01:12:07,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:07,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945558805] [2025-03-04 01:12:07,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:07,728 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-04 01:12:07,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:07,731 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-04 01:12:07,732 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-04 01:12:07,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:12:07,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:12:07,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:07,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:07,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:12:07,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:07,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:12:08,022 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-04 01:12:08,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:08,022 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:08,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945558805] [2025-03-04 01:12:08,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945558805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:08,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:08,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:12:08,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24680495] [2025-03-04 01:12:08,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:08,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:12:08,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:08,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:12:08,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:12:08,023 INFO L87 Difference]: Start difference. First operand 405 states and 562 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 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-04 01:12:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:08,145 INFO L93 Difference]: Finished difference Result 1008 states and 1399 transitions. [2025-03-04 01:12:08,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:12:08,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 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-04 01:12:08,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:08,152 INFO L225 Difference]: With dead ends: 1008 [2025-03-04 01:12:08,152 INFO L226 Difference]: Without dead ends: 630 [2025-03-04 01:12:08,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:12:08,153 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 145 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:08,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 598 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:12:08,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-03-04 01:12:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 436. [2025-03-04 01:12:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 371 states have (on average 1.3234501347708896) internal successors, (491), 373 states have internal predecessors, (491), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (55), 53 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-04 01:12:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 601 transitions. [2025-03-04 01:12:08,183 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 601 transitions. Word has length 141 [2025-03-04 01:12:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:08,183 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 601 transitions. [2025-03-04 01:12:08,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 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-04 01:12:08,183 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 601 transitions. [2025-03-04 01:12:08,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:12:08,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:08,184 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, 1, 1] [2025-03-04 01:12:08,192 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-04 01:12:08,386 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-04 01:12:08,386 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:08,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:08,387 INFO L85 PathProgramCache]: Analyzing trace with hash 855461412, now seen corresponding path program 1 times [2025-03-04 01:12:08,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:08,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231348419] [2025-03-04 01:12:08,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:08,387 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-04 01:12:08,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:08,390 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-04 01:12:08,391 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-04 01:12:08,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:12:08,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:12:08,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:08,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:08,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:12:08,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:08,556 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-04 01:12:08,556 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:08,556 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:08,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231348419] [2025-03-04 01:12:08,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231348419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:08,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:08,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:12:08,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517039652] [2025-03-04 01:12:08,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:08,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:12:08,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:08,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:12:08,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:12:08,557 INFO L87 Difference]: Start difference. First operand 436 states and 601 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-04 01:12:08,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:08,589 INFO L93 Difference]: Finished difference Result 826 states and 1143 transitions. [2025-03-04 01:12:08,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:12:08,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 143 [2025-03-04 01:12:08,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:08,592 INFO L225 Difference]: With dead ends: 826 [2025-03-04 01:12:08,592 INFO L226 Difference]: Without dead ends: 448 [2025-03-04 01:12:08,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 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-04 01:12:08,593 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:08,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:12:08,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-03-04 01:12:08,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2025-03-04 01:12:08,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 383 states have (on average 1.3133159268929504) internal successors, (503), 385 states have internal predecessors, (503), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (55), 53 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-04 01:12:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 613 transitions. [2025-03-04 01:12:08,629 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 613 transitions. Word has length 143 [2025-03-04 01:12:08,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:08,630 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 613 transitions. [2025-03-04 01:12:08,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-04 01:12:08,630 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 613 transitions. [2025-03-04 01:12:08,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:12:08,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:08,631 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, 1, 1] [2025-03-04 01:12:08,637 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-04 01:12:08,831 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-04 01:12:08,832 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:08,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:08,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1330057977, now seen corresponding path program 1 times [2025-03-04 01:12:08,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:08,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630627705] [2025-03-04 01:12:08,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:08,833 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-04 01:12:08,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:08,834 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-04 01:12:08,837 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-04 01:12:08,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:12:08,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:12:08,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:08,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:08,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:12:08,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:09,249 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2025-03-04 01:12:09,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:12: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-04 01:12:09,371 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:09,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630627705] [2025-03-04 01:12:09,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630627705] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:12:09,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:12:09,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2025-03-04 01:12:09,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244181538] [2025-03-04 01:12:09,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:09,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:12:09,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:09,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:12:09,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:12:09,372 INFO L87 Difference]: Start difference. First operand 448 states and 613 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-04 01:12:09,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:09,466 INFO L93 Difference]: Finished difference Result 993 states and 1361 transitions. [2025-03-04 01:12:09,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:12:09,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 143 [2025-03-04 01:12:09,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:09,470 INFO L225 Difference]: With dead ends: 993 [2025-03-04 01:12:09,470 INFO L226 Difference]: Without dead ends: 603 [2025-03-04 01:12:09,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:12:09,471 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 160 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:09,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 557 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:12:09,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-04 01:12:09,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 483. [2025-03-04 01:12:09,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 418 states have (on average 1.325358851674641) internal successors, (554), 420 states have internal predecessors, (554), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (55), 53 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-04 01:12:09,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 664 transitions. [2025-03-04 01:12:09,496 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 664 transitions. Word has length 143 [2025-03-04 01:12:09,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:09,497 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 664 transitions. [2025-03-04 01:12:09,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-04 01:12:09,497 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 664 transitions. [2025-03-04 01:12:09,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:12:09,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:09,498 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, 1, 1] [2025-03-04 01:12:09,504 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-04 01:12:09,698 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-04 01:12:09,699 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:09,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:09,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1967836966, now seen corresponding path program 1 times [2025-03-04 01:12:09,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:09,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139147269] [2025-03-04 01:12:09,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:09,699 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-04 01:12:09,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:09,701 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-04 01:12:09,702 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-04 01:12:09,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:12:09,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:12:09,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:09,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:09,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:12:09,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:09,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:12:09,993 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-04 01:12:09,993 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:09,993 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:09,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139147269] [2025-03-04 01:12:09,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139147269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:09,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:09,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:12:09,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109798385] [2025-03-04 01:12:09,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:09,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:12:09,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:09,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:12:09,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:12:09,994 INFO L87 Difference]: Start difference. First operand 483 states and 664 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-04 01:12:10,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:10,094 INFO L93 Difference]: Finished difference Result 1061 states and 1464 transitions. [2025-03-04 01:12:10,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:12:10,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 143 [2025-03-04 01:12:10,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:10,096 INFO L225 Difference]: With dead ends: 1061 [2025-03-04 01:12:10,096 INFO L226 Difference]: Without dead ends: 636 [2025-03-04 01:12:10,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:12:10,097 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 130 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:10,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 595 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:12:10,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-04 01:12:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 533. [2025-03-04 01:12:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 468 states have (on average 1.3354700854700854) internal successors, (625), 470 states have internal predecessors, (625), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (55), 53 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-04 01:12:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 735 transitions. [2025-03-04 01:12:10,119 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 735 transitions. Word has length 143 [2025-03-04 01:12:10,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:10,119 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 735 transitions. [2025-03-04 01:12:10,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-04 01:12:10,119 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 735 transitions. [2025-03-04 01:12:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 01:12:10,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:10,121 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, 1, 1, 1] [2025-03-04 01:12:10,132 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 (12)] Ended with exit code 0 [2025-03-04 01:12:10,322 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-04 01:12:10,322 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:10,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:10,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1237065983, now seen corresponding path program 1 times [2025-03-04 01:12:10,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:10,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294948069] [2025-03-04 01:12:10,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:10,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:12:10,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:10,324 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-04 01:12:10,326 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-04 01:12:10,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:12:10,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:12:10,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:10,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:10,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:12:10,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2025-03-04 01:12:10,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:12:10,803 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-04 01:12:10,803 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:10,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294948069] [2025-03-04 01:12:10,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294948069] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:12:10,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:12:10,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-03-04 01:12:10,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597898325] [2025-03-04 01:12:10,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:10,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:12:10,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:10,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:12:10,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:12:10,804 INFO L87 Difference]: Start difference. First operand 533 states and 735 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-04 01:12:10,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:10,887 INFO L93 Difference]: Finished difference Result 1070 states and 1470 transitions. [2025-03-04 01:12:10,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:12:10,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 144 [2025-03-04 01:12:10,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:10,890 INFO L225 Difference]: With dead ends: 1070 [2025-03-04 01:12:10,890 INFO L226 Difference]: Without dead ends: 645 [2025-03-04 01:12:10,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:12:10,891 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 138 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:10,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 430 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:12:10,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-03-04 01:12:10,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 535. [2025-03-04 01:12:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 470 states have (on average 1.3297872340425532) internal successors, (625), 472 states have internal predecessors, (625), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (55), 53 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-04 01:12:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 735 transitions. [2025-03-04 01:12:10,913 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 735 transitions. Word has length 144 [2025-03-04 01:12:10,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:10,914 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 735 transitions. [2025-03-04 01:12:10,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-04 01:12:10,914 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 735 transitions. [2025-03-04 01:12:10,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 01:12:10,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:10,917 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, 1, 1, 1, 1] [2025-03-04 01:12:10,925 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-04 01:12:11,117 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-04 01:12:11,117 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:11,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:11,118 INFO L85 PathProgramCache]: Analyzing trace with hash 410674374, now seen corresponding path program 1 times [2025-03-04 01:12:11,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:11,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439755042] [2025-03-04 01:12:11,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:11,118 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-04 01:12:11,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:11,120 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-04 01:12:11,121 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-04 01:12:11,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 01:12:11,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 01:12:11,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:11,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:11,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:12:11,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2025-03-04 01:12:11,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:12:11,620 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-04 01:12:11,620 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:11,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439755042] [2025-03-04 01:12:11,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439755042] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:12:11,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:12:11,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-03-04 01:12:11,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116557343] [2025-03-04 01:12:11,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:11,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:12:11,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:11,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:12:11,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:12:11,621 INFO L87 Difference]: Start difference. First operand 535 states and 735 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-04 01:12:11,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:11,706 INFO L93 Difference]: Finished difference Result 1060 states and 1448 transitions. [2025-03-04 01:12:11,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:12:11,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 145 [2025-03-04 01:12:11,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:11,709 INFO L225 Difference]: With dead ends: 1060 [2025-03-04 01:12:11,709 INFO L226 Difference]: Without dead ends: 633 [2025-03-04 01:12:11,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:12:11,711 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 64 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:11,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 574 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:12:11,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-04 01:12:11,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 543. [2025-03-04 01:12:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 478 states have (on average 1.3263598326359833) internal successors, (634), 480 states have internal predecessors, (634), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (55), 53 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-04 01:12:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 744 transitions. [2025-03-04 01:12:11,732 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 744 transitions. Word has length 145 [2025-03-04 01:12:11,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:11,732 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 744 transitions. [2025-03-04 01:12:11,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-04 01:12:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 744 transitions. [2025-03-04 01:12:11,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 01:12:11,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:11,734 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, 1, 1, 1, 1, 1] [2025-03-04 01:12:11,744 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-04 01:12:11,934 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-04 01:12:11,935 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:11,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:11,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1213815445, now seen corresponding path program 1 times [2025-03-04 01:12:11,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:11,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053058038] [2025-03-04 01:12:11,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:11,936 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-04 01:12:11,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:11,939 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-04 01:12:11,940 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-04 01:12:12,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:12:12,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:12:12,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:12,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:12,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:12:12,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:12,146 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-04 01:12:12,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:12,151 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 28 treesize of output 31 [2025-03-04 01:12:12,214 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-04 01:12:12,214 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:12,214 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:12,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053058038] [2025-03-04 01:12:12,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053058038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:12,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:12,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:12:12,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096855531] [2025-03-04 01:12:12,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:12,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:12:12,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:12,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:12:12,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:12:12,215 INFO L87 Difference]: Start difference. First operand 543 states and 744 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-04 01:12:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:12,433 INFO L93 Difference]: Finished difference Result 1318 states and 1792 transitions. [2025-03-04 01:12:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:12:12,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 146 [2025-03-04 01:12:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:12,437 INFO L225 Difference]: With dead ends: 1318 [2025-03-04 01:12:12,437 INFO L226 Difference]: Without dead ends: 883 [2025-03-04 01:12:12,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 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-04 01:12:12,438 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 100 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:12,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 909 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:12:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-03-04 01:12:12,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 871. [2025-03-04 01:12:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 773 states have (on average 1.3091849935316946) internal successors, (1012), 779 states have internal predecessors, (1012), 83 states have call successors, (83), 14 states have call predecessors, (83), 14 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-04 01:12:12,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1178 transitions. [2025-03-04 01:12:12,466 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1178 transitions. Word has length 146 [2025-03-04 01:12:12,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:12,466 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1178 transitions. [2025-03-04 01:12:12,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-04 01:12:12,466 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1178 transitions. [2025-03-04 01:12:12,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 01:12:12,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:12,467 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, 1, 1, 1, 1, 1] [2025-03-04 01:12:12,473 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-04 01:12:12,668 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-04 01:12:12,668 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:12,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:12,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2095258558, now seen corresponding path program 1 times [2025-03-04 01:12:12,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:12,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915891430] [2025-03-04 01:12:12,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:12,669 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-04 01:12:12,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:12,670 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-04 01:12:12,671 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-04 01:12:12,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:12:12,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:12:12,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:12,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:12,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 01:12:12,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:12,894 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-04 01:12:12,900 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-04 01:12:12,927 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 27 treesize of output 11 [2025-03-04 01:12:12,946 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 27 treesize of output 11 [2025-03-04 01:12:12,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2025-03-04 01:12:13,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:13,053 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 41 treesize of output 37 [2025-03-04 01:12:13,089 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 15 treesize of output 7 [2025-03-04 01:12:13,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:13,185 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 96 treesize of output 42 [2025-03-04 01:12:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 232 proven. 12 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-04 01:12:13,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:12:13,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-04 01:12:13,500 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:13,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915891430] [2025-03-04 01:12:13,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915891430] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:12:13,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:12:13,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 21 [2025-03-04 01:12:13,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793869822] [2025-03-04 01:12:13,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:13,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:12:13,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:13,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:12:13,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:12:13,501 INFO L87 Difference]: Start difference. First operand 871 states and 1178 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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-04 01:12:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:13,950 INFO L93 Difference]: Finished difference Result 1624 states and 2197 transitions. [2025-03-04 01:12:13,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:12:13,951 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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 146 [2025-03-04 01:12:13,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:13,955 INFO L225 Difference]: With dead ends: 1624 [2025-03-04 01:12:13,955 INFO L226 Difference]: Without dead ends: 867 [2025-03-04 01:12:13,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:12:13,958 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 297 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:13,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 755 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:12:13,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-03-04 01:12:13,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 859. [2025-03-04 01:12:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 758 states have (on average 1.3021108179419525) internal successors, (987), 764 states have internal predecessors, (987), 83 states have call successors, (83), 17 states have call predecessors, (83), 17 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-04 01:12:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1153 transitions. [2025-03-04 01:12:13,991 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1153 transitions. Word has length 146 [2025-03-04 01:12:13,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:13,991 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1153 transitions. [2025-03-04 01:12:13,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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-04 01:12:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1153 transitions. [2025-03-04 01:12:13,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:12:13,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:13,994 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:14,001 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-04 01:12:14,195 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-04 01:12:14,195 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:14,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:14,195 INFO L85 PathProgramCache]: Analyzing trace with hash 17032183, now seen corresponding path program 1 times [2025-03-04 01:12:14,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:14,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703684423] [2025-03-04 01:12:14,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:14,196 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-04 01:12:14,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:14,198 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-04 01:12:14,199 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-04 01:12:14,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:12:14,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:12:14,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:14,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:14,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 01:12:14,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:14,392 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-04 01:12:14,392 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:14,392 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:14,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703684423] [2025-03-04 01:12:14,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703684423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:14,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:14,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:12:14,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705461927] [2025-03-04 01:12:14,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:14,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:12:14,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:14,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:12:14,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:12:14,393 INFO L87 Difference]: Start difference. First operand 859 states and 1153 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04 01:12:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:14,436 INFO L93 Difference]: Finished difference Result 1608 states and 2167 transitions. [2025-03-04 01:12:14,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:12:14,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 148 [2025-03-04 01:12:14,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:14,440 INFO L225 Difference]: With dead ends: 1608 [2025-03-04 01:12:14,440 INFO L226 Difference]: Without dead ends: 867 [2025-03-04 01:12:14,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:12:14,442 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:14,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:12:14,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-03-04 01:12:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 867. [2025-03-04 01:12:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 766 states have (on average 1.2989556135770235) internal successors, (995), 772 states have internal predecessors, (995), 83 states have call successors, (83), 17 states have call predecessors, (83), 17 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-04 01:12:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1161 transitions. [2025-03-04 01:12:14,474 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1161 transitions. Word has length 148 [2025-03-04 01:12:14,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:14,475 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1161 transitions. [2025-03-04 01:12:14,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04 01:12:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1161 transitions. [2025-03-04 01:12:14,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:12:14,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:14,477 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:14,483 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 (17)] Forceful destruction successful, exit code 0 [2025-03-04 01:12:14,677 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-04 01:12:14,678 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:14,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:14,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1391742612, now seen corresponding path program 1 times [2025-03-04 01:12:14,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:14,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040033554] [2025-03-04 01:12:14,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:14,679 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-04 01:12:14,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:14,680 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-04 01:12:14,681 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-04 01:12:14,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:12:14,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:12:14,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:14,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:14,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 01:12:14,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:15,017 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 26 treesize of output 14 [2025-03-04 01:12:15,035 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-04 01:12:15,151 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-04 01:12:15,271 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 27 treesize of output 11 [2025-03-04 01:12:15,341 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 27 treesize of output 11 [2025-03-04 01:12:15,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:15,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-03-04 01:12:15,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:15,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 41 [2025-03-04 01:12:15,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:15,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 01:12:15,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:15,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 13 [2025-03-04 01:12:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 379 proven. 12 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-04 01:12:15,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:12:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:12:16,032 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:16,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040033554] [2025-03-04 01:12:16,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040033554] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:12:16,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:12:16,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-04 01:12:16,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220128663] [2025-03-04 01:12:16,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:12:16,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:12:16,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:16,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:12:16,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:12:16,034 INFO L87 Difference]: Start difference. First operand 867 states and 1161 transitions. Second operand has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 17 states have internal predecessors, (133), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) [2025-03-04 01:12:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:17,712 INFO L93 Difference]: Finished difference Result 1655 states and 2206 transitions. [2025-03-04 01:12:17,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 01:12:17,712 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 17 states have internal predecessors, (133), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) Word has length 148 [2025-03-04 01:12:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:17,716 INFO L225 Difference]: With dead ends: 1655 [2025-03-04 01:12:17,716 INFO L226 Difference]: Without dead ends: 906 [2025-03-04 01:12:17,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=448, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:12:17,717 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 208 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:17,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1094 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 01:12:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2025-03-04 01:12:17,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 867. [2025-03-04 01:12:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 766 states have (on average 1.293733681462141) internal successors, (991), 772 states have internal predecessors, (991), 83 states have call successors, (83), 17 states have call predecessors, (83), 17 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-04 01:12:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1157 transitions. [2025-03-04 01:12:17,751 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1157 transitions. Word has length 148 [2025-03-04 01:12:17,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:17,751 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1157 transitions. [2025-03-04 01:12:17,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 17 states have internal predecessors, (133), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) [2025-03-04 01:12:17,752 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1157 transitions. [2025-03-04 01:12:17,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:12:17,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:17,752 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:17,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 (18)] Ended with exit code 0 [2025-03-04 01:12:17,953 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-04 01:12:17,953 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:17,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:17,953 INFO L85 PathProgramCache]: Analyzing trace with hash 519203893, now seen corresponding path program 1 times [2025-03-04 01:12:17,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:17,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991741209] [2025-03-04 01:12:17,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:17,954 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-04 01:12:17,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:17,957 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-04 01:12:17,958 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-04 01:12:18,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:12:18,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:12:18,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:18,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:18,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:12:18,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:18,252 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-04 01:12:18,252 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:18,252 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:18,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991741209] [2025-03-04 01:12:18,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991741209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:18,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:18,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:12:18,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384364938] [2025-03-04 01:12:18,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:18,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:12:18,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:18,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:12:18,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:12:18,253 INFO L87 Difference]: Start difference. First operand 867 states and 1157 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-04 01:12:18,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:18,715 INFO L93 Difference]: Finished difference Result 2398 states and 3203 transitions. [2025-03-04 01:12:18,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:12:18,716 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 150 [2025-03-04 01:12:18,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:18,720 INFO L225 Difference]: With dead ends: 2398 [2025-03-04 01:12:18,720 INFO L226 Difference]: Without dead ends: 1623 [2025-03-04 01:12:18,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:12:18,721 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 294 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:18,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 778 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:12:18,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2025-03-04 01:12:18,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1601. [2025-03-04 01:12:18,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1413 states have (on average 1.2802547770700636) internal successors, (1809), 1426 states have internal predecessors, (1809), 155 states have call successors, (155), 32 states have call predecessors, (155), 32 states have return successors, (155), 142 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-04 01:12:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2119 transitions. [2025-03-04 01:12:18,778 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2119 transitions. Word has length 150 [2025-03-04 01:12:18,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:18,778 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2119 transitions. [2025-03-04 01:12:18,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-04 01:12:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2119 transitions. [2025-03-04 01:12:18,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:12:18,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:18,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:18,786 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-04 01:12:18,980 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-04 01:12:18,980 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:18,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:18,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2111057675, now seen corresponding path program 1 times [2025-03-04 01:12:18,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:18,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029264171] [2025-03-04 01:12:18,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:18,981 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-04 01:12:18,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:18,983 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-04 01:12:18,983 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-04 01:12:19,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:12:19,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:12:19,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:19,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:19,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:12:19,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:19,265 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-04 01:12:19,265 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:19,265 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:19,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029264171] [2025-03-04 01:12:19,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029264171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:19,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:19,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:12:19,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523710032] [2025-03-04 01:12:19,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:19,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:12:19,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:19,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:12:19,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:12:19,266 INFO L87 Difference]: Start difference. First operand 1601 states and 2119 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-04 01:12:19,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:19,788 INFO L93 Difference]: Finished difference Result 3059 states and 4050 transitions. [2025-03-04 01:12:19,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:12:19,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 150 [2025-03-04 01:12:19,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:19,793 INFO L225 Difference]: With dead ends: 3059 [2025-03-04 01:12:19,793 INFO L226 Difference]: Without dead ends: 1591 [2025-03-04 01:12:19,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:12:19,795 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 252 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:19,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 847 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:12:19,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2025-03-04 01:12:19,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1569. [2025-03-04 01:12:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1381 states have (on average 1.2693700217233888) internal successors, (1753), 1394 states have internal predecessors, (1753), 155 states have call successors, (155), 32 states have call predecessors, (155), 32 states have return successors, (155), 142 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-04 01:12:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2063 transitions. [2025-03-04 01:12:19,856 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2063 transitions. Word has length 150 [2025-03-04 01:12:19,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:19,856 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2063 transitions. [2025-03-04 01:12:19,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-04 01:12:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2063 transitions. [2025-03-04 01:12:19,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:12:19,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:19,857 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:19,862 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-04 01:12:20,057 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-04 01:12:20,058 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:20,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:20,058 INFO L85 PathProgramCache]: Analyzing trace with hash -680017938, now seen corresponding path program 1 times [2025-03-04 01:12:20,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:20,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904965816] [2025-03-04 01:12:20,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:20,058 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-04 01:12:20,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:20,060 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-04 01:12:20,061 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-04 01:12:20,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:12:20,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:12:20,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:20,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:20,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 01:12:20,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:20,311 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-04 01:12:20,315 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-04 01:12:20,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:20,369 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 57 treesize of output 27 [2025-03-04 01:12:20,386 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-04 01:12:20,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:20,387 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:20,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904965816] [2025-03-04 01:12:20,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904965816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:20,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:20,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:12:20,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146927438] [2025-03-04 01:12:20,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:20,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:12:20,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:20,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:12:20,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:12:20,388 INFO L87 Difference]: Start difference. First operand 1569 states and 2063 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-04 01:12:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:20,497 INFO L93 Difference]: Finished difference Result 1651 states and 2152 transitions. [2025-03-04 01:12:20,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:12:20,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 150 [2025-03-04 01:12:20,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:20,502 INFO L225 Difference]: With dead ends: 1651 [2025-03-04 01:12:20,502 INFO L226 Difference]: Without dead ends: 1649 [2025-03-04 01:12:20,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 145 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-04 01:12:20,503 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 83 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:20,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 834 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:12:20,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-03-04 01:12:20,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2025-03-04 01:12:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1453 states have (on average 1.2560220233998625) internal successors, (1825), 1466 states have internal predecessors, (1825), 155 states have call successors, (155), 40 states have call predecessors, (155), 40 states have return successors, (155), 142 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-04 01:12:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2135 transitions. [2025-03-04 01:12:20,574 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2135 transitions. Word has length 150 [2025-03-04 01:12:20,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:20,575 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2135 transitions. [2025-03-04 01:12:20,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-04 01:12:20,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2135 transitions. [2025-03-04 01:12:20,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:12:20,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:20,577 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:20,584 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-04 01:12:20,777 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-04 01:12:20,777 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:20,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:20,778 INFO L85 PathProgramCache]: Analyzing trace with hash -679094417, now seen corresponding path program 1 times [2025-03-04 01:12:20,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:20,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309964478] [2025-03-04 01:12:20,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:20,778 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-04 01:12:20,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:20,780 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-04 01:12:20,782 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-04 01:12:20,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:12:21,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:12:21,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:21,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:21,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 01:12:21,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:21,052 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-04 01:12:21,514 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-04 01:12:21,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:21,687 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-04 01:12:21,722 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-04 01:12:21,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:12:21,881 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:21,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309964478] [2025-03-04 01:12:21,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309964478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:12:21,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [540702728] [2025-03-04 01:12:21,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:21,882 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:12:21,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:12:21,884 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-04 01:12:21,884 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-04 01:12:22,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:12:22,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:12:22,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:22,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:22,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 01:12:22,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:22,549 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-04 01:12:23,266 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-04 01:12:23,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:23,492 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-04 01:12:23,503 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-04 01:12:23,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:12:23,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [540702728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:12:23,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:12:23,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-03-04 01:12:23,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680934224] [2025-03-04 01:12:23,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:12:23,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:12:23,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:23,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:12:23,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:12:23,622 INFO L87 Difference]: Start difference. First operand 1649 states and 2135 transitions. Second operand has 16 states, 16 states have (on average 8.5) internal successors, (136), 15 states have internal predecessors, (136), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-04 01:12:24,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:24,275 INFO L93 Difference]: Finished difference Result 4798 states and 6188 transitions. [2025-03-04 01:12:24,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:12:24,276 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.5) internal successors, (136), 15 states have internal predecessors, (136), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 150 [2025-03-04 01:12:24,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:24,285 INFO L225 Difference]: With dead ends: 4798 [2025-03-04 01:12:24,285 INFO L226 Difference]: Without dead ends: 3286 [2025-03-04 01:12:24,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:12:24,287 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 318 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:24,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1202 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:12:24,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3286 states. [2025-03-04 01:12:24,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3286 to 3276. [2025-03-04 01:12:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3276 states, 2882 states have (on average 1.2463566967383761) internal successors, (3592), 2916 states have internal predecessors, (3592), 306 states have call successors, (306), 87 states have call predecessors, (306), 87 states have return successors, (306), 272 states have call predecessors, (306), 306 states have call successors, (306) [2025-03-04 01:12:24,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 4204 transitions. [2025-03-04 01:12:24,455 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 4204 transitions. Word has length 150 [2025-03-04 01:12:24,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:24,456 INFO L471 AbstractCegarLoop]: Abstraction has 3276 states and 4204 transitions. [2025-03-04 01:12:24,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.5) internal successors, (136), 15 states have internal predecessors, (136), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-04 01:12:24,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 4204 transitions. [2025-03-04 01:12:24,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:12:24,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:24,458 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:24,466 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-04 01:12:24,664 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 (22)] Ended with exit code 0 [2025-03-04 01:12:24,859 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-04 01:12:24,859 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:24,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:24,859 INFO L85 PathProgramCache]: Analyzing trace with hash 208409264, now seen corresponding path program 1 times [2025-03-04 01:12:24,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:24,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539952033] [2025-03-04 01:12:24,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:24,860 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-04 01:12:24,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:24,861 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-04 01:12:24,862 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-04 01:12:24,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:12:25,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:12:25,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:25,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:25,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:12:25,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:25,056 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-04 01:12:25,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2025-03-04 01:12:25,090 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-04 01:12:25,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:25,090 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:25,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539952033] [2025-03-04 01:12:25,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539952033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:25,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:25,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:12:25,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024831682] [2025-03-04 01:12:25,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:25,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:12:25,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:25,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:12:25,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:12:25,091 INFO L87 Difference]: Start difference. First operand 3276 states and 4204 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-04 01:12:25,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:25,305 INFO L93 Difference]: Finished difference Result 6298 states and 8081 transitions. [2025-03-04 01:12:25,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:12:25,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 150 [2025-03-04 01:12:25,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:25,316 INFO L225 Difference]: With dead ends: 6298 [2025-03-04 01:12:25,316 INFO L226 Difference]: Without dead ends: 3276 [2025-03-04 01:12:25,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:12:25,322 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 131 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:25,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 780 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:12:25,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2025-03-04 01:12:25,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3276. [2025-03-04 01:12:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3276 states, 2882 states have (on average 1.2352532963219987) internal successors, (3560), 2916 states have internal predecessors, (3560), 306 states have call successors, (306), 87 states have call predecessors, (306), 87 states have return successors, (306), 272 states have call predecessors, (306), 306 states have call successors, (306) [2025-03-04 01:12:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 4172 transitions. [2025-03-04 01:12:25,533 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 4172 transitions. Word has length 150 [2025-03-04 01:12:25,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:25,534 INFO L471 AbstractCegarLoop]: Abstraction has 3276 states and 4172 transitions. [2025-03-04 01:12:25,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-04 01:12:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 4172 transitions. [2025-03-04 01:12:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:12:25,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:25,536 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:25,542 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-04 01:12:25,736 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-04 01:12:25,736 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:25,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:25,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1599045199, now seen corresponding path program 1 times [2025-03-04 01:12:25,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:25,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954950831] [2025-03-04 01:12:25,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:25,737 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-04 01:12:25,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:25,739 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-04 01:12:25,740 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-04 01:12:25,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:12:25,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:12:25,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:25,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:25,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:12:25,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:25,961 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-04 01:12:26,006 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 16 [2025-03-04 01:12:26,017 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 25 treesize of output 13 [2025-03-04 01:12:26,061 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-04 01:12:26,062 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:26,062 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:26,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954950831] [2025-03-04 01:12:26,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954950831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:26,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:26,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:12:26,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780098111] [2025-03-04 01:12:26,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:26,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:12:26,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:26,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:12:26,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:12:26,063 INFO L87 Difference]: Start difference. First operand 3276 states and 4172 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-04 01:12:26,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:26,785 INFO L93 Difference]: Finished difference Result 6434 states and 8188 transitions. [2025-03-04 01:12:26,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:12:26,786 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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 150 [2025-03-04 01:12:26,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:26,797 INFO L225 Difference]: With dead ends: 6434 [2025-03-04 01:12:26,797 INFO L226 Difference]: Without dead ends: 3412 [2025-03-04 01:12:26,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:12:26,802 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 133 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:26,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1458 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:12:26,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3412 states. [2025-03-04 01:12:26,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3412 to 3396. [2025-03-04 01:12:26,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3396 states, 3002 states have (on average 1.2258494337108594) internal successors, (3680), 3036 states have internal predecessors, (3680), 306 states have call successors, (306), 87 states have call predecessors, (306), 87 states have return successors, (306), 272 states have call predecessors, (306), 306 states have call successors, (306) [2025-03-04 01:12:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 4292 transitions. [2025-03-04 01:12:26,974 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 4292 transitions. Word has length 150 [2025-03-04 01:12:26,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:26,974 INFO L471 AbstractCegarLoop]: Abstraction has 3396 states and 4292 transitions. [2025-03-04 01:12:26,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-04 01:12:26,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 4292 transitions. [2025-03-04 01:12:26,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:12:26,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:26,977 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:26,982 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 (25)] Forceful destruction successful, exit code 0 [2025-03-04 01:12:27,177 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-04 01:12:27,178 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:27,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:27,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1892448206, now seen corresponding path program 1 times [2025-03-04 01:12:27,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:27,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927167572] [2025-03-04 01:12:27,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:27,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-04 01:12:27,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:27,181 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-04 01:12:27,183 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-04 01:12:27,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:12:27,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:12:27,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:27,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:27,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:12:27,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:27,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 22 treesize of output 10 [2025-03-04 01:12:27,450 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-04 01:12:27,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:27,451 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:27,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927167572] [2025-03-04 01:12:27,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [927167572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:27,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:27,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:12:27,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775321059] [2025-03-04 01:12:27,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:27,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:12:27,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:27,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:12:27,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:12:27,452 INFO L87 Difference]: Start difference. First operand 3396 states and 4292 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-04 01:12:27,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:27,798 INFO L93 Difference]: Finished difference Result 6452 states and 8150 transitions. [2025-03-04 01:12:27,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:12:27,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 150 [2025-03-04 01:12:27,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:27,810 INFO L225 Difference]: With dead ends: 6452 [2025-03-04 01:12:27,810 INFO L226 Difference]: Without dead ends: 3310 [2025-03-04 01:12:27,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:12:27,818 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 127 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:27,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 489 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:12:27,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2025-03-04 01:12:27,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 3300. [2025-03-04 01:12:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 2906 states have (on average 1.2167928423950447) internal successors, (3536), 2940 states have internal predecessors, (3536), 306 states have call successors, (306), 87 states have call predecessors, (306), 87 states have return successors, (306), 272 states have call predecessors, (306), 306 states have call successors, (306) [2025-03-04 01:12:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 4148 transitions. [2025-03-04 01:12:27,975 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 4148 transitions. Word has length 150 [2025-03-04 01:12:27,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:27,975 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 4148 transitions. [2025-03-04 01:12:27,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-04 01:12:27,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 4148 transitions. [2025-03-04 01:12:27,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:12:27,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:27,977 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:27,984 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-04 01:12:28,183 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-04 01:12:28,183 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:28,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:28,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1878922338, now seen corresponding path program 1 times [2025-03-04 01:12:28,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:28,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738947704] [2025-03-04 01:12:28,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:28,184 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-04 01:12:28,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:28,186 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-04 01:12:28,187 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-04 01:12:28,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:12:28,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:12:28,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:28,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:28,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 01:12:28,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:28,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 01:12:28,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2025-03-04 01:12:28,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:28,446 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 41 treesize of output 37 [2025-03-04 01:12:28,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:28,585 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 58 treesize of output 22 [2025-03-04 01:12:28,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-04 01:12:28,630 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:28,630 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:28,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738947704] [2025-03-04 01:12:28,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738947704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:28,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:28,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:12:28,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866923883] [2025-03-04 01:12:28,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:28,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:12:28,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:28,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:12:28,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:12:28,631 INFO L87 Difference]: Start difference. First operand 3300 states and 4148 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 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-04 01:12:29,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:29,644 INFO L93 Difference]: Finished difference Result 6874 states and 8676 transitions. [2025-03-04 01:12:29,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:12:29,645 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 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 150 [2025-03-04 01:12:29,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:29,665 INFO L225 Difference]: With dead ends: 6874 [2025-03-04 01:12:29,666 INFO L226 Difference]: Without dead ends: 4948 [2025-03-04 01:12:29,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:12:29,670 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 225 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:29,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1511 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:12:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4948 states. [2025-03-04 01:12:29,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4948 to 3686. [2025-03-04 01:12:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3686 states, 3292 states have (on average 1.2430133657351154) internal successors, (4092), 3326 states have internal predecessors, (4092), 306 states have call successors, (306), 87 states have call predecessors, (306), 87 states have return successors, (306), 272 states have call predecessors, (306), 306 states have call successors, (306) [2025-03-04 01:12:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 4704 transitions. [2025-03-04 01:12:29,839 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 4704 transitions. Word has length 150 [2025-03-04 01:12:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:29,839 INFO L471 AbstractCegarLoop]: Abstraction has 3686 states and 4704 transitions. [2025-03-04 01:12:29,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 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-04 01:12:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 4704 transitions. [2025-03-04 01:12:29,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:12:29,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:29,841 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:29,848 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-04 01:12:30,042 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-04 01:12:30,042 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:30,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:30,042 INFO L85 PathProgramCache]: Analyzing trace with hash -525612641, now seen corresponding path program 1 times [2025-03-04 01:12:30,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:30,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865415933] [2025-03-04 01:12:30,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:30,043 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-04 01:12:30,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:30,047 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-04 01:12:30,047 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-04 01:12:30,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:12:30,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:12:30,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:30,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:30,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 01:12:30,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:30,282 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-04 01:12:30,284 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-04 01:12:30,285 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-04 01:12:30,304 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 27 treesize of output 11 [2025-03-04 01:12:30,317 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 27 treesize of output 11 [2025-03-04 01:12:30,336 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-04 01:12:30,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:30,382 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 41 treesize of output 37 [2025-03-04 01:12:30,414 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 15 treesize of output 7 [2025-03-04 01:12:30,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:30,526 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 66 treesize of output 28 [2025-03-04 01:12:31,342 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 232 proven. 12 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-04 01:12:31,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:12:32,034 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-04 01:12:32,034 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:32,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865415933] [2025-03-04 01:12:32,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865415933] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:12:32,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:12:32,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2025-03-04 01:12:32,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546848912] [2025-03-04 01:12:32,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:32,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:12:32,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:32,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:12:32,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:12:32,035 INFO L87 Difference]: Start difference. First operand 3686 states and 4704 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-04 01:12:33,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:33,176 INFO L93 Difference]: Finished difference Result 7698 states and 9777 transitions. [2025-03-04 01:12:33,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:12:33,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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 150 [2025-03-04 01:12:33,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:33,188 INFO L225 Difference]: With dead ends: 7698 [2025-03-04 01:12:33,188 INFO L226 Difference]: Without dead ends: 5448 [2025-03-04 01:12:33,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:12:33,191 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 398 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:33,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 949 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:12:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5448 states. [2025-03-04 01:12:33,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5448 to 4982. [2025-03-04 01:12:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4982 states, 4491 states have (on average 1.231128924515698) internal successors, (5529), 4550 states have internal predecessors, (5529), 376 states have call successors, (376), 114 states have call predecessors, (376), 114 states have return successors, (376), 317 states have call predecessors, (376), 376 states have call successors, (376) [2025-03-04 01:12:33,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4982 states to 4982 states and 6281 transitions. [2025-03-04 01:12:33,407 INFO L78 Accepts]: Start accepts. Automaton has 4982 states and 6281 transitions. Word has length 150 [2025-03-04 01:12:33,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:33,407 INFO L471 AbstractCegarLoop]: Abstraction has 4982 states and 6281 transitions. [2025-03-04 01:12:33,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-04 01:12:33,407 INFO L276 IsEmpty]: Start isEmpty. Operand 4982 states and 6281 transitions. [2025-03-04 01:12:33,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:12:33,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:33,410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:33,418 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 (28)] Forceful destruction successful, exit code 0 [2025-03-04 01:12:33,614 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-04 01:12:33,614 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:33,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:33,614 INFO L85 PathProgramCache]: Analyzing trace with hash 232368031, now seen corresponding path program 1 times [2025-03-04 01:12:33,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:33,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450301272] [2025-03-04 01:12:33,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:33,615 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-04 01:12:33,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:33,619 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-04 01:12:33,619 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-04 01:12:33,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:12:33,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:12:33,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:33,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:33,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 01:12:33,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:33,848 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-04 01:12:33,872 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-04 01:12:33,962 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-04 01:12:34,057 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 27 treesize of output 11 [2025-03-04 01:12:34,113 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 27 treesize of output 11 [2025-03-04 01:12:34,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:34,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2025-03-04 01:12:34,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:34,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 60 [2025-03-04 01:12:34,403 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 15 treesize of output 7 [2025-03-04 01:12:34,974 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 419 proven. 12 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-04 01:12:34,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:12:35,442 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-04 01:12:35,442 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:35,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450301272] [2025-03-04 01:12:35,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450301272] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:12:35,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:12:35,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [19] total 30 [2025-03-04 01:12:35,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631660318] [2025-03-04 01:12:35,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:35,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:12:35,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:35,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:12:35,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2025-03-04 01:12:35,443 INFO L87 Difference]: Start difference. First operand 4982 states and 6281 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 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-04 01:12:36,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:36,966 INFO L93 Difference]: Finished difference Result 11200 states and 14160 transitions. [2025-03-04 01:12:36,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:12:36,967 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 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 150 [2025-03-04 01:12:36,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:36,982 INFO L225 Difference]: With dead ends: 11200 [2025-03-04 01:12:36,983 INFO L226 Difference]: Without dead ends: 7684 [2025-03-04 01:12:36,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=323, Invalid=937, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 01:12:36,989 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 420 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:36,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1878 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:12:36,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7684 states. [2025-03-04 01:12:37,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7684 to 5408. [2025-03-04 01:12:37,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5408 states, 4917 states have (on average 1.2525930445393532) internal successors, (6159), 4976 states have internal predecessors, (6159), 376 states have call successors, (376), 114 states have call predecessors, (376), 114 states have return successors, (376), 317 states have call predecessors, (376), 376 states have call successors, (376) [2025-03-04 01:12:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5408 states to 5408 states and 6911 transitions. [2025-03-04 01:12:37,243 INFO L78 Accepts]: Start accepts. Automaton has 5408 states and 6911 transitions. Word has length 150 [2025-03-04 01:12:37,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:37,243 INFO L471 AbstractCegarLoop]: Abstraction has 5408 states and 6911 transitions. [2025-03-04 01:12:37,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 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-04 01:12:37,244 INFO L276 IsEmpty]: Start isEmpty. Operand 5408 states and 6911 transitions. [2025-03-04 01:12:37,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:12:37,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:37,246 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:37,251 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-04 01:12:37,446 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-04 01:12:37,455 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:37,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:37,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1585677728, now seen corresponding path program 1 times [2025-03-04 01:12:37,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:37,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270310031] [2025-03-04 01:12:37,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:37,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:12:37,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:37,458 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-04 01:12:37,459 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-04 01:12:37,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:12:37,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:12:37,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:37,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:37,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 01:12:37,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:37,801 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-04 01:12:37,804 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-04 01:12:37,805 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-04 01:12:37,831 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 27 treesize of output 11 [2025-03-04 01:12:37,849 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 27 treesize of output 11 [2025-03-04 01:12:37,876 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-04 01:12:37,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2025-03-04 01:12:37,922 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 15 treesize of output 7 [2025-03-04 01:12:38,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:38,037 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 48 treesize of output 22 [2025-03-04 01:12:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 232 proven. 12 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-04 01:12:38,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:12:38,389 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-04 01:12:38,389 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:38,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270310031] [2025-03-04 01:12:38,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270310031] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:12:38,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:12:38,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [15] total 22 [2025-03-04 01:12:38,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376331278] [2025-03-04 01:12:38,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:38,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:12:38,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:38,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:12:38,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:12:38,390 INFO L87 Difference]: Start difference. First operand 5408 states and 6911 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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-04 01:12:39,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:39,466 INFO L93 Difference]: Finished difference Result 11206 states and 14255 transitions. [2025-03-04 01:12:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 01:12:39,467 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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 150 [2025-03-04 01:12:39,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:39,482 INFO L225 Difference]: With dead ends: 11206 [2025-03-04 01:12:39,482 INFO L226 Difference]: Without dead ends: 7282 [2025-03-04 01:12:39,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2025-03-04 01:12:39,488 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 309 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:39,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1691 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:12:39,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7282 states. [2025-03-04 01:12:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7282 to 5534. [2025-03-04 01:12:39,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5534 states, 5043 states have (on average 1.2585762442990283) internal successors, (6347), 5102 states have internal predecessors, (6347), 376 states have call successors, (376), 114 states have call predecessors, (376), 114 states have return successors, (376), 317 states have call predecessors, (376), 376 states have call successors, (376) [2025-03-04 01:12:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5534 states to 5534 states and 7099 transitions. [2025-03-04 01:12:39,726 INFO L78 Accepts]: Start accepts. Automaton has 5534 states and 7099 transitions. Word has length 150 [2025-03-04 01:12:39,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:39,727 INFO L471 AbstractCegarLoop]: Abstraction has 5534 states and 7099 transitions. [2025-03-04 01:12:39,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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-04 01:12:39,727 INFO L276 IsEmpty]: Start isEmpty. Operand 5534 states and 7099 transitions. [2025-03-04 01:12:39,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:12:39,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:39,729 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:39,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-04 01:12:39,929 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 [2025-03-04 01:12:39,929 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:39,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:39,930 INFO L85 PathProgramCache]: Analyzing trace with hash -494163810, now seen corresponding path program 1 times [2025-03-04 01:12:39,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:39,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549452842] [2025-03-04 01:12:39,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:39,930 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-04 01:12:39,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:39,932 INFO L229 MonitoredProcess]: Starting monitored process 31 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-04 01:12:39,932 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 (31)] Waiting until timeout for monitored process [2025-03-04 01:12:40,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:12:40,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:12:40,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:40,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:40,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:12:40,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:40,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-03-04 01:12:40,316 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2025-03-04 01:12:40,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:12:40,404 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-04 01:12:40,404 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:40,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549452842] [2025-03-04 01:12:40,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549452842] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:12:40,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:12:40,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-04 01:12:40,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580337118] [2025-03-04 01:12:40,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:40,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:12:40,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:40,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:12:40,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:12:40,405 INFO L87 Difference]: Start difference. First operand 5534 states and 7099 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-04 01:12:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:40,638 INFO L93 Difference]: Finished difference Result 10326 states and 13216 transitions. [2025-03-04 01:12:40,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:12:40,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 150 [2025-03-04 01:12:40,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:40,649 INFO L225 Difference]: With dead ends: 10326 [2025-03-04 01:12:40,649 INFO L226 Difference]: Without dead ends: 5138 [2025-03-04 01:12:40,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:12:40,660 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 174 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:40,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 557 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:12:40,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5138 states. [2025-03-04 01:12:40,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5138 to 5110. [2025-03-04 01:12:40,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5110 states, 4619 states have (on average 1.249404633037454) internal successors, (5771), 4678 states have internal predecessors, (5771), 376 states have call successors, (376), 114 states have call predecessors, (376), 114 states have return successors, (376), 317 states have call predecessors, (376), 376 states have call successors, (376) [2025-03-04 01:12:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5110 states to 5110 states and 6523 transitions. [2025-03-04 01:12:40,861 INFO L78 Accepts]: Start accepts. Automaton has 5110 states and 6523 transitions. Word has length 150 [2025-03-04 01:12:40,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:40,861 INFO L471 AbstractCegarLoop]: Abstraction has 5110 states and 6523 transitions. [2025-03-04 01:12:40,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-04 01:12:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 5110 states and 6523 transitions. [2025-03-04 01:12:40,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:12:40,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:40,863 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:40,868 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 (31)] Ended with exit code 0 [2025-03-04 01:12:41,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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-04 01:12:41,064 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:41,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:41,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1712412784, now seen corresponding path program 1 times [2025-03-04 01:12:41,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:41,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695189150] [2025-03-04 01:12:41,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:41,064 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-04 01:12:41,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:41,067 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-04 01:12:41,068 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-04 01:12:41,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:12:41,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:12:41,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:41,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:41,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:12:41,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:41,297 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-04 01:12:41,297 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:41,297 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:41,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695189150] [2025-03-04 01:12:41,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695189150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:41,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:41,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:12:41,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611231368] [2025-03-04 01:12:41,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:41,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:12:41,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:41,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:12:41,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:12:41,298 INFO L87 Difference]: Start difference. First operand 5110 states and 6523 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-04 01:12:41,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:41,483 INFO L93 Difference]: Finished difference Result 10035 states and 12807 transitions. [2025-03-04 01:12:41,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:12:41,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 150 [2025-03-04 01:12:41,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:41,494 INFO L225 Difference]: With dead ends: 10035 [2025-03-04 01:12:41,495 INFO L226 Difference]: Without dead ends: 5110 [2025-03-04 01:12:41,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 147 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-04 01:12:41,501 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 451 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-04 01:12:41,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 451 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:12:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5110 states. [2025-03-04 01:12:41,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5110 to 5110. [2025-03-04 01:12:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5110 states, 4619 states have (on average 1.2463736739554017) internal successors, (5757), 4678 states have internal predecessors, (5757), 376 states have call successors, (376), 114 states have call predecessors, (376), 114 states have return successors, (376), 317 states have call predecessors, (376), 376 states have call successors, (376) [2025-03-04 01:12:41,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5110 states to 5110 states and 6509 transitions. [2025-03-04 01:12:41,828 INFO L78 Accepts]: Start accepts. Automaton has 5110 states and 6509 transitions. Word has length 150 [2025-03-04 01:12:41,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:41,828 INFO L471 AbstractCegarLoop]: Abstraction has 5110 states and 6509 transitions. [2025-03-04 01:12:41,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-04 01:12:41,828 INFO L276 IsEmpty]: Start isEmpty. Operand 5110 states and 6509 transitions. [2025-03-04 01:12:41,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:12:41,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:41,831 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:41,836 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-04 01:12:42,031 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-04 01:12:42,031 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:42,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:42,032 INFO L85 PathProgramCache]: Analyzing trace with hash 500809964, now seen corresponding path program 1 times [2025-03-04 01:12:42,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:42,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137412330] [2025-03-04 01:12:42,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:42,032 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-04 01:12:42,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:42,034 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-04 01:12:42,035 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-04 01:12:42,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:12:42,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:12:42,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:42,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:42,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:12:42,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-03-04 01:12:42,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:42,270 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:42,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137412330] [2025-03-04 01:12:42,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137412330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:42,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:42,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:12:42,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495482403] [2025-03-04 01:12:42,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:42,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:12:42,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:42,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:12:42,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:12:42,272 INFO L87 Difference]: Start difference. First operand 5110 states and 6509 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:12:42,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:42,606 INFO L93 Difference]: Finished difference Result 10202 states and 12961 transitions. [2025-03-04 01:12:42,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:12:42,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 152 [2025-03-04 01:12:42,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:42,623 INFO L225 Difference]: With dead ends: 10202 [2025-03-04 01:12:42,623 INFO L226 Difference]: Without dead ends: 5254 [2025-03-04 01:12:42,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:12:42,634 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:42,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 631 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:12:42,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2025-03-04 01:12:42,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 5110. [2025-03-04 01:12:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5110 states, 4619 states have (on average 1.2433427148733491) internal successors, (5743), 4678 states have internal predecessors, (5743), 376 states have call successors, (376), 114 states have call predecessors, (376), 114 states have return successors, (376), 317 states have call predecessors, (376), 376 states have call successors, (376) [2025-03-04 01:12:42,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5110 states to 5110 states and 6495 transitions. [2025-03-04 01:12:42,880 INFO L78 Accepts]: Start accepts. Automaton has 5110 states and 6495 transitions. Word has length 152 [2025-03-04 01:12:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:42,880 INFO L471 AbstractCegarLoop]: Abstraction has 5110 states and 6495 transitions. [2025-03-04 01:12:42,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:12:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 5110 states and 6495 transitions. [2025-03-04 01:12:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:12:42,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:42,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:42,891 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-04 01:12:43,083 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-04 01:12:43,083 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:43,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1100356083, now seen corresponding path program 1 times [2025-03-04 01:12:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:43,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166539689] [2025-03-04 01:12:43,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:43,084 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-04 01:12:43,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:43,087 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-04 01:12:43,090 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-04 01:12:43,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:12:43,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:12:43,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:43,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:43,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 01:12:43,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:43,366 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-04 01:12:43,792 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-04 01:12:43,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:43,961 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 201 treesize of output 75 [2025-03-04 01:12:43,994 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-04 01:12:43,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:12:44,117 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:44,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166539689] [2025-03-04 01:12:44,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166539689] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:12:44,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [13593342] [2025-03-04 01:12:44,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:44,118 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:12:44,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:12:44,119 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:12:44,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2025-03-04 01:12:44,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:12:44,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:12:44,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:44,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:44,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 01:12:44,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:44,757 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