./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2cb36cc0f0fd05117e5167c95d28ca6a711637d120a8a77c2820981a0c818fc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:25:35,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:25:35,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:25:35,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:25:35,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:25:35,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:25:35,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:25:35,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:25:35,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:25:35,682 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:25:35,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:25:35,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:25:35,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:25:35,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:25:35,684 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:25:35,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:25:35,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:25:35,684 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:25:35,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:25:35,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:25:35,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:25:35,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:25:35,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:25:35,684 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:25:35,684 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:25:35,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:25:35,684 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:25:35,685 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:25:35,685 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:25:35,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:25:35,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:25:35,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:25:35,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:25:35,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:25:35,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:25:35,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:25:35,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:25:35,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:25:35,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:25:35,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:25:35,685 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:25:35,685 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:25:35,685 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:25:35,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:25:35,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:25:35,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:25:35,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:25:35,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:25:35,687 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2cb36cc0f0fd05117e5167c95d28ca6a711637d120a8a77c2820981a0c818fc [2025-01-09 15:25:35,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:25:35,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:25:35,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:25:35,977 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:25:35,977 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:25:35,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i [2025-01-09 15:25:37,123 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c9ee7ce7/1fc54d73f82a4bf6937b99699052384c/FLAG930e4e25e [2025-01-09 15:25:37,344 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:25:37,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i [2025-01-09 15:25:37,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c9ee7ce7/1fc54d73f82a4bf6937b99699052384c/FLAG930e4e25e [2025-01-09 15:25:37,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c9ee7ce7/1fc54d73f82a4bf6937b99699052384c [2025-01-09 15:25:37,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:25:37,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:25:37,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:25:37,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:25:37,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:25:37,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:25:37" (1/1) ... [2025-01-09 15:25:37,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18cc1480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:37, skipping insertion in model container [2025-01-09 15:25:37,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:25:37" (1/1) ... [2025-01-09 15:25:37,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:25:37,838 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i[916,929] [2025-01-09 15:25:37,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:25:37,916 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:25:37,926 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i[916,929] [2025-01-09 15:25:37,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:25:37,969 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:25:37,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:37 WrapperNode [2025-01-09 15:25:37,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:25:37,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:25:37,970 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:25:37,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:25:37,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:37" (1/1) ... [2025-01-09 15:25:37,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:37" (1/1) ... [2025-01-09 15:25:38,024 INFO L138 Inliner]: procedures = 29, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 521 [2025-01-09 15:25:38,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:25:38,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:25:38,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:25:38,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:25:38,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:37" (1/1) ... [2025-01-09 15:25:38,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:37" (1/1) ... [2025-01-09 15:25:38,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:37" (1/1) ... [2025-01-09 15:25:38,056 INFO L175 MemorySlicer]: Split 132 memory accesses to 7 slices as follows [2, 8, 39, 12, 5, 41, 25]. 31 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 3, 1, 2, 2]. The 16 writes are split as follows [0, 1, 6, 3, 2, 2, 2]. [2025-01-09 15:25:38,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:37" (1/1) ... [2025-01-09 15:25:38,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:37" (1/1) ... [2025-01-09 15:25:38,079 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:37" (1/1) ... [2025-01-09 15:25:38,080 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:37" (1/1) ... [2025-01-09 15:25:38,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:37" (1/1) ... [2025-01-09 15:25:38,089 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:37" (1/1) ... [2025-01-09 15:25:38,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:37" (1/1) ... [2025-01-09 15:25:38,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:25:38,103 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:25:38,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:25:38,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:25:38,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:37" (1/1) ... [2025-01-09 15:25:38,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:25:38,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:25:38,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:25:38,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:25:38,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:25:38,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:25:38,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:25:38,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:25:38,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:25:38,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:25:38,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:25:38,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-01-09 15:25:38,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:25:38,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:25:38,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:25:38,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:25:38,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:25:38,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:25:38,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:25:38,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:25:38,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:25:38,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:25:38,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:25:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:25:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:25:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-01-09 15:25:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:25:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:25:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:25:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:25:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:25:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:25:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:25:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:25:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:25:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:25:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:25:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:25:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:25:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-01-09 15:25:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:25:38,159 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:25:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:25:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:25:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:25:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:25:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:25:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:25:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:25:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:25:38,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:25:38,294 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:25:38,295 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:25:38,740 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2025-01-09 15:25:38,741 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:25:38,749 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:25:38,749 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:25:38,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:25:38 BoogieIcfgContainer [2025-01-09 15:25:38,750 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:25:38,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:25:38,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:25:38,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:25:38,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:25:37" (1/3) ... [2025-01-09 15:25:38,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687ca985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:25:38, skipping insertion in model container [2025-01-09 15:25:38,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:37" (2/3) ... [2025-01-09 15:25:38,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687ca985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:25:38, skipping insertion in model container [2025-01-09 15:25:38,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:25:38" (3/3) ... [2025-01-09 15:25:38,756 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-70.i [2025-01-09 15:25:38,766 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:25:38,767 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-70.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:25:38,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:25:38,808 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;@348776f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:25:38,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:25:38,811 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 95 states have (on average 1.431578947368421) internal successors, (136), 96 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:38,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:25:38,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:38,818 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:38,818 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:38,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:38,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2081875538, now seen corresponding path program 1 times [2025-01-09 15:25:38,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:38,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819807858] [2025-01-09 15:25:38,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:38,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:38,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:25:38,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:25:38,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:38,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 15:25:39,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:39,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819807858] [2025-01-09 15:25:39,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819807858] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:25:39,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858481603] [2025-01-09 15:25:39,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:39,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:25:39,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:25:39,072 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:25:39,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:25:39,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:25:39,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:25:39,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:39,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:39,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:25:39,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:39,280 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 15:25:39,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:39,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858481603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:39,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:25:39,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:25:39,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258425567] [2025-01-09 15:25:39,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:39,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:25:39,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:39,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:25:39,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:25:39,298 INFO L87 Difference]: Start difference. First operand has 110 states, 95 states have (on average 1.431578947368421) internal successors, (136), 96 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:39,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:39,314 INFO L93 Difference]: Finished difference Result 214 states and 327 transitions. [2025-01-09 15:25:39,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:25:39,315 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2025-01-09 15:25:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:39,319 INFO L225 Difference]: With dead ends: 214 [2025-01-09 15:25:39,319 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 15:25:39,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:25:39,323 INFO L435 NwaCegarLoop]: 155 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, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:39,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:39,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 15:25:39,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-01-09 15:25:39,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2025-01-09 15:25:39,349 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 116 [2025-01-09 15:25:39,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:39,349 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2025-01-09 15:25:39,349 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:39,349 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2025-01-09 15:25:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:25:39,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:39,354 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:39,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:25:39,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:25:39,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:39,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:39,556 INFO L85 PathProgramCache]: Analyzing trace with hash -229506334, now seen corresponding path program 1 times [2025-01-09 15:25:39,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:39,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192057311] [2025-01-09 15:25:39,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:39,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:39,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:25:39,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:25:39,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:39,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:39,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:39,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192057311] [2025-01-09 15:25:39,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192057311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:39,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:39,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:25:39,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958901684] [2025-01-09 15:25:39,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:39,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:25:39,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:39,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:25:39,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:25:39,874 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:39,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:39,913 INFO L93 Difference]: Finished difference Result 213 states and 310 transitions. [2025-01-09 15:25:39,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:25:39,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2025-01-09 15:25:39,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:39,915 INFO L225 Difference]: With dead ends: 213 [2025-01-09 15:25:39,915 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 15:25:39,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:25:39,916 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:39,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:39,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 15:25:39,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-01-09 15:25:39,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:39,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-01-09 15:25:39,930 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 116 [2025-01-09 15:25:39,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:39,931 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-01-09 15:25:39,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:39,931 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-01-09 15:25:39,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:25:39,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:39,934 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:39,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:25:39,934 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:39,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:39,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2106569564, now seen corresponding path program 1 times [2025-01-09 15:25:39,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:39,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155486905] [2025-01-09 15:25:39,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:39,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:39,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:25:40,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:25:40,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:40,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:40,186 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 15:25:40,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:40,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155486905] [2025-01-09 15:25:40,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155486905] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:25:40,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063563873] [2025-01-09 15:25:40,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:40,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:25:40,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:25:40,194 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:25:40,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:25:40,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:25:40,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:25:40,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:40,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:40,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:25:40,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:40,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:40,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063563873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:40,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:25:40,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 15:25:40,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779236982] [2025-01-09 15:25:40,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:40,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:25:40,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:40,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:25:40,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:25:40,412 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:40,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:40,437 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2025-01-09 15:25:40,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:25:40,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2025-01-09 15:25:40,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:40,440 INFO L225 Difference]: With dead ends: 218 [2025-01-09 15:25:40,441 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 15:25:40,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:25:40,444 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:40,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 15:25:40,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-01-09 15:25:40,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:40,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2025-01-09 15:25:40,453 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 116 [2025-01-09 15:25:40,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:40,453 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2025-01-09 15:25:40,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2025-01-09 15:25:40,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:25:40,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:40,457 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:40,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 15:25:40,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:25:40,658 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:40,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:40,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2104722522, now seen corresponding path program 1 times [2025-01-09 15:25:40,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:40,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386646308] [2025-01-09 15:25:40,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:40,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:40,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:25:40,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:25:40,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:40,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:40,827 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 15:25:40,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:40,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386646308] [2025-01-09 15:25:40,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386646308] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:25:40,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464926184] [2025-01-09 15:25:40,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:40,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:25:40,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:25:40,830 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:25:40,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 15:25:40,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:25:40,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:25:40,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:40,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:40,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:25:41,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:41,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:41,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464926184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:41,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:25:41,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-01-09 15:25:41,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384867633] [2025-01-09 15:25:41,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:41,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:25:41,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:41,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:25:41,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:41,033 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:41,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:41,061 INFO L93 Difference]: Finished difference Result 221 states and 318 transitions. [2025-01-09 15:25:41,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:25:41,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2025-01-09 15:25:41,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:41,063 INFO L225 Difference]: With dead ends: 221 [2025-01-09 15:25:41,065 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 15:25:41,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:41,066 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:41,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:41,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 15:25:41,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-01-09 15:25:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2025-01-09 15:25:41,076 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 116 [2025-01-09 15:25:41,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:41,076 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2025-01-09 15:25:41,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:41,076 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2025-01-09 15:25:41,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 15:25:41,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:41,079 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:41,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 15:25:41,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:25:41,279 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:41,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:41,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2013527295, now seen corresponding path program 1 times [2025-01-09 15:25:41,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:41,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295993190] [2025-01-09 15:25:41,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:41,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:41,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 15:25:41,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 15:25:41,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:41,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:41,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:41,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295993190] [2025-01-09 15:25:41,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295993190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:41,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:41,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:25:41,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016565545] [2025-01-09 15:25:41,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:41,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:25:41,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:41,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:25:41,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:41,701 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:41,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:41,750 INFO L93 Difference]: Finished difference Result 280 states and 400 transitions. [2025-01-09 15:25:41,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:25:41,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-01-09 15:25:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:41,754 INFO L225 Difference]: With dead ends: 280 [2025-01-09 15:25:41,754 INFO L226 Difference]: Without dead ends: 170 [2025-01-09 15:25:41,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:41,755 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 149 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:41,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 574 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:41,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-09 15:25:41,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 116. [2025-01-09 15:25:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:41,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2025-01-09 15:25:41,760 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 118 [2025-01-09 15:25:41,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:41,761 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2025-01-09 15:25:41,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:41,761 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2025-01-09 15:25:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 15:25:41,762 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:41,762 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:41,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:25:41,762 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:41,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:41,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1810939071, now seen corresponding path program 1 times [2025-01-09 15:25:41,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:41,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520407493] [2025-01-09 15:25:41,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:41,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:41,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 15:25:41,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 15:25:41,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:41,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:41,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:41,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520407493] [2025-01-09 15:25:41,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520407493] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:41,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:41,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:25:41,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643284839] [2025-01-09 15:25:41,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:41,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:25:41,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:41,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:25:41,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:25:41,925 INFO L87 Difference]: Start difference. First operand 116 states and 164 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:41,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:41,978 INFO L93 Difference]: Finished difference Result 229 states and 325 transitions. [2025-01-09 15:25:41,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:25:41,978 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-01-09 15:25:41,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:41,979 INFO L225 Difference]: With dead ends: 229 [2025-01-09 15:25:41,979 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 15:25:41,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:25:41,980 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:41,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 402 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:41,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 15:25:41,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-01-09 15:25:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.3627450980392157) internal successors, (139), 102 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 163 transitions. [2025-01-09 15:25:41,985 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 163 transitions. Word has length 118 [2025-01-09 15:25:41,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:41,985 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 163 transitions. [2025-01-09 15:25:41,985 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:41,985 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 163 transitions. [2025-01-09 15:25:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 15:25:41,986 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:41,986 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:41,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:25:41,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:41,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:41,987 INFO L85 PathProgramCache]: Analyzing trace with hash -193867110, now seen corresponding path program 1 times [2025-01-09 15:25:41,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:41,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078439092] [2025-01-09 15:25:41,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:41,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:42,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 15:25:42,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 15:25:42,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:42,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:42,325 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:42,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:42,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078439092] [2025-01-09 15:25:42,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078439092] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:42,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:42,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:25:42,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618041998] [2025-01-09 15:25:42,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:42,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:25:42,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:42,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:25:42,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:42,327 INFO L87 Difference]: Start difference. First operand 116 states and 163 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:42,525 INFO L93 Difference]: Finished difference Result 330 states and 466 transitions. [2025-01-09 15:25:42,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:25:42,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2025-01-09 15:25:42,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:42,527 INFO L225 Difference]: With dead ends: 330 [2025-01-09 15:25:42,528 INFO L226 Difference]: Without dead ends: 217 [2025-01-09 15:25:42,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:42,528 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 129 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:42,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 770 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:25:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-09 15:25:42,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 125. [2025-01-09 15:25:42,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 111 states have (on average 1.3603603603603605) internal successors, (151), 111 states have internal predecessors, (151), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:42,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 175 transitions. [2025-01-09 15:25:42,540 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 175 transitions. Word has length 120 [2025-01-09 15:25:42,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:42,542 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 175 transitions. [2025-01-09 15:25:42,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 175 transitions. [2025-01-09 15:25:42,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 15:25:42,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:42,544 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:42,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:25:42,544 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:42,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:42,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1882810852, now seen corresponding path program 1 times [2025-01-09 15:25:42,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:42,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239606733] [2025-01-09 15:25:42,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:42,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:42,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 15:25:42,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 15:25:42,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:42,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:42,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:42,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239606733] [2025-01-09 15:25:42,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239606733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:42,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:42,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:25:42,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871468178] [2025-01-09 15:25:42,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:42,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:25:42,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:42,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:25:42,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:42,902 INFO L87 Difference]: Start difference. First operand 125 states and 175 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:42,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:42,961 INFO L93 Difference]: Finished difference Result 306 states and 427 transitions. [2025-01-09 15:25:42,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:25:42,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-01-09 15:25:42,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:42,964 INFO L225 Difference]: With dead ends: 306 [2025-01-09 15:25:42,964 INFO L226 Difference]: Without dead ends: 184 [2025-01-09 15:25:42,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:42,965 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 114 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:42,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 573 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:42,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-09 15:25:42,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 149. [2025-01-09 15:25:42,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 135 states have (on average 1.3555555555555556) internal successors, (183), 135 states have internal predecessors, (183), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:42,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 207 transitions. [2025-01-09 15:25:42,973 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 207 transitions. Word has length 120 [2025-01-09 15:25:42,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:42,973 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 207 transitions. [2025-01-09 15:25:42,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:42,977 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 207 transitions. [2025-01-09 15:25:42,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:25:42,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:42,978 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:42,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:25:42,979 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:42,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:42,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1526616181, now seen corresponding path program 1 times [2025-01-09 15:25:42,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:42,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235586831] [2025-01-09 15:25:42,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:42,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:42,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:25:43,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:25:43,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:43,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:43,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:43,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235586831] [2025-01-09 15:25:43,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235586831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:43,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:43,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:25:43,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247576065] [2025-01-09 15:25:43,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:43,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:25:43,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:43,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:25:43,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:43,308 INFO L87 Difference]: Start difference. First operand 149 states and 207 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:43,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:43,366 INFO L93 Difference]: Finished difference Result 331 states and 460 transitions. [2025-01-09 15:25:43,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:25:43,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-01-09 15:25:43,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:43,369 INFO L225 Difference]: With dead ends: 331 [2025-01-09 15:25:43,369 INFO L226 Difference]: Without dead ends: 185 [2025-01-09 15:25:43,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:43,370 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 53 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:43,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 710 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-09 15:25:43,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2025-01-09 15:25:43,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 139 states have (on average 1.3453237410071943) internal successors, (187), 139 states have internal predecessors, (187), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:43,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 211 transitions. [2025-01-09 15:25:43,378 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 211 transitions. Word has length 121 [2025-01-09 15:25:43,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:43,379 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 211 transitions. [2025-01-09 15:25:43,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:43,379 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 211 transitions. [2025-01-09 15:25:43,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:25:43,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:43,380 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:43,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:25:43,380 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:43,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:43,381 INFO L85 PathProgramCache]: Analyzing trace with hash 477370187, now seen corresponding path program 1 times [2025-01-09 15:25:43,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:43,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14442006] [2025-01-09 15:25:43,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:43,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:43,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:25:43,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:25:43,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:43,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 15:25:43,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:43,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14442006] [2025-01-09 15:25:43,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14442006] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:25:43,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262119224] [2025-01-09 15:25:43,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:43,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:25:43,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:25:43,537 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:25:43,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 15:25:43,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:25:43,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:25:43,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:43,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:43,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:25:43,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:43,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:43,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262119224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:43,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:25:43,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 15:25:43,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064784963] [2025-01-09 15:25:43,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:43,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:25:43,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:43,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:25:43,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:25:43,723 INFO L87 Difference]: Start difference. First operand 153 states and 211 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:43,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:43,749 INFO L93 Difference]: Finished difference Result 306 states and 423 transitions. [2025-01-09 15:25:43,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:25:43,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2025-01-09 15:25:43,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:43,751 INFO L225 Difference]: With dead ends: 306 [2025-01-09 15:25:43,751 INFO L226 Difference]: Without dead ends: 156 [2025-01-09 15:25:43,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 122 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-01-09 15:25:43,751 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 587 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-01-09 15:25:43,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 587 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:43,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-09 15:25:43,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-01-09 15:25:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 142 states have (on average 1.3380281690140845) internal successors, (190), 142 states have internal predecessors, (190), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:43,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 214 transitions. [2025-01-09 15:25:43,756 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 214 transitions. Word has length 121 [2025-01-09 15:25:43,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:43,756 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 214 transitions. [2025-01-09 15:25:43,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 214 transitions. [2025-01-09 15:25:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 15:25:43,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:43,757 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:43,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 15:25:43,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 15:25:43,958 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:43,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:43,958 INFO L85 PathProgramCache]: Analyzing trace with hash 174359297, now seen corresponding path program 1 times [2025-01-09 15:25:43,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:43,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838153772] [2025-01-09 15:25:43,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:43,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:43,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 15:25:44,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 15:25:44,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:44,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:45,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:45,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838153772] [2025-01-09 15:25:45,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838153772] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:45,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:45,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:25:45,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837070162] [2025-01-09 15:25:45,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:45,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:25:45,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:45,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:25:45,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:25:45,152 INFO L87 Difference]: Start difference. First operand 156 states and 214 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:46,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:46,318 INFO L93 Difference]: Finished difference Result 530 states and 733 transitions. [2025-01-09 15:25:46,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 15:25:46,318 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-01-09 15:25:46,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:46,320 INFO L225 Difference]: With dead ends: 530 [2025-01-09 15:25:46,321 INFO L226 Difference]: Without dead ends: 377 [2025-01-09 15:25:46,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:25:46,323 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 374 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:46,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1771 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 15:25:46,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-01-09 15:25:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 176. [2025-01-09 15:25:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 162 states have (on average 1.345679012345679) internal successors, (218), 162 states have internal predecessors, (218), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 242 transitions. [2025-01-09 15:25:46,334 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 242 transitions. Word has length 122 [2025-01-09 15:25:46,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:46,335 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 242 transitions. [2025-01-09 15:25:46,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:46,335 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 242 transitions. [2025-01-09 15:25:46,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 15:25:46,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:46,336 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:46,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:25:46,337 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:46,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:46,337 INFO L85 PathProgramCache]: Analyzing trace with hash -846709057, now seen corresponding path program 1 times [2025-01-09 15:25:46,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:46,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687945555] [2025-01-09 15:25:46,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:46,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:46,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 15:25:46,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 15:25:46,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:46,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:46,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:46,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687945555] [2025-01-09 15:25:46,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687945555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:46,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:46,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:25:46,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299232838] [2025-01-09 15:25:46,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:46,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:25:46,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:46,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:25:46,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:46,636 INFO L87 Difference]: Start difference. First operand 176 states and 242 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:46,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:46,761 INFO L93 Difference]: Finished difference Result 450 states and 622 transitions. [2025-01-09 15:25:46,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:25:46,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-01-09 15:25:46,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:46,763 INFO L225 Difference]: With dead ends: 450 [2025-01-09 15:25:46,763 INFO L226 Difference]: Without dead ends: 277 [2025-01-09 15:25:46,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:46,764 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 125 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:46,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1124 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:46,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-01-09 15:25:46,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 274. [2025-01-09 15:25:46,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 249 states have (on average 1.3453815261044177) internal successors, (335), 250 states have internal predecessors, (335), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 15:25:46,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 379 transitions. [2025-01-09 15:25:46,778 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 379 transitions. Word has length 122 [2025-01-09 15:25:46,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:46,778 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 379 transitions. [2025-01-09 15:25:46,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:46,779 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 379 transitions. [2025-01-09 15:25:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 15:25:46,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:46,782 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:46,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:25:46,782 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:46,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:46,782 INFO L85 PathProgramCache]: Analyzing trace with hash 875959171, now seen corresponding path program 1 times [2025-01-09 15:25:46,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:46,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63305192] [2025-01-09 15:25:46,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:46,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:46,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 15:25:46,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 15:25:46,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:46,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:47,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:47,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63305192] [2025-01-09 15:25:47,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63305192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:47,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:47,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:25:47,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082690785] [2025-01-09 15:25:47,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:47,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:25:47,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:47,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:25:47,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:47,092 INFO L87 Difference]: Start difference. First operand 274 states and 379 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:47,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:47,211 INFO L93 Difference]: Finished difference Result 623 states and 863 transitions. [2025-01-09 15:25:47,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:25:47,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-01-09 15:25:47,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:47,215 INFO L225 Difference]: With dead ends: 623 [2025-01-09 15:25:47,215 INFO L226 Difference]: Without dead ends: 352 [2025-01-09 15:25:47,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:47,217 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 127 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:47,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 800 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:47,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-01-09 15:25:47,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 264. [2025-01-09 15:25:47,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 239 states have (on average 1.3389121338912133) internal successors, (320), 240 states have internal predecessors, (320), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 15:25:47,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 364 transitions. [2025-01-09 15:25:47,236 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 364 transitions. Word has length 122 [2025-01-09 15:25:47,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:47,236 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 364 transitions. [2025-01-09 15:25:47,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 364 transitions. [2025-01-09 15:25:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 15:25:47,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:47,237 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:47,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:25:47,237 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:47,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:47,239 INFO L85 PathProgramCache]: Analyzing trace with hash -145109183, now seen corresponding path program 1 times [2025-01-09 15:25:47,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:47,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843925192] [2025-01-09 15:25:47,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:47,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:47,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 15:25:47,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 15:25:47,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:47,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:48,115 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:48,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:48,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843925192] [2025-01-09 15:25:48,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843925192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:48,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:48,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:25:48,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075449129] [2025-01-09 15:25:48,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:48,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:25:48,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:48,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:25:48,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:25:48,118 INFO L87 Difference]: Start difference. First operand 264 states and 364 transitions. Second operand has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:25:48,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:48,766 INFO L93 Difference]: Finished difference Result 722 states and 998 transitions. [2025-01-09 15:25:48,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:25:48,766 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 122 [2025-01-09 15:25:48,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:48,769 INFO L225 Difference]: With dead ends: 722 [2025-01-09 15:25:48,770 INFO L226 Difference]: Without dead ends: 460 [2025-01-09 15:25:48,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:25:48,772 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 382 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:48,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 2314 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:25:48,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-01-09 15:25:48,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 287. [2025-01-09 15:25:48,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 262 states have (on average 1.3396946564885497) internal successors, (351), 263 states have internal predecessors, (351), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 15:25:48,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 395 transitions. [2025-01-09 15:25:48,797 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 395 transitions. Word has length 122 [2025-01-09 15:25:48,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:48,798 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 395 transitions. [2025-01-09 15:25:48,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:25:48,798 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 395 transitions. [2025-01-09 15:25:48,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 15:25:48,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:48,800 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:48,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:25:48,800 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:48,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:48,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1778118851, now seen corresponding path program 1 times [2025-01-09 15:25:48,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:48,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733152586] [2025-01-09 15:25:48,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:48,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:48,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 15:25:48,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 15:25:48,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:48,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:49,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:49,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733152586] [2025-01-09 15:25:49,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733152586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:49,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:49,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:25:49,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123748961] [2025-01-09 15:25:49,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:49,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:25:49,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:49,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:25:49,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:25:49,790 INFO L87 Difference]: Start difference. First operand 287 states and 395 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:53,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:53,225 INFO L93 Difference]: Finished difference Result 754 states and 1039 transitions. [2025-01-09 15:25:53,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 15:25:53,227 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-01-09 15:25:53,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:53,229 INFO L225 Difference]: With dead ends: 754 [2025-01-09 15:25:53,229 INFO L226 Difference]: Without dead ends: 470 [2025-01-09 15:25:53,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:25:53,230 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 351 mSDsluCounter, 1949 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:53,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 2207 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 15:25:53,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-01-09 15:25:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 290. [2025-01-09 15:25:53,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 265 states have (on average 1.3396226415094339) internal successors, (355), 266 states have internal predecessors, (355), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 15:25:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 399 transitions. [2025-01-09 15:25:53,253 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 399 transitions. Word has length 122 [2025-01-09 15:25:53,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:53,254 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 399 transitions. [2025-01-09 15:25:53,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 399 transitions. [2025-01-09 15:25:53,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:25:53,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:53,255 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:53,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:25:53,255 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:53,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:53,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2116116294, now seen corresponding path program 1 times [2025-01-09 15:25:53,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:53,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110878807] [2025-01-09 15:25:53,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:53,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:53,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:25:53,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:25:53,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:53,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:53,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:53,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110878807] [2025-01-09 15:25:53,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110878807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:53,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:53,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:25:53,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765456678] [2025-01-09 15:25:53,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:53,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:25:53,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:53,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:25:53,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:53,458 INFO L87 Difference]: Start difference. First operand 290 states and 399 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:53,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:53,553 INFO L93 Difference]: Finished difference Result 843 states and 1163 transitions. [2025-01-09 15:25:53,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:25:53,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2025-01-09 15:25:53,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:53,556 INFO L225 Difference]: With dead ends: 843 [2025-01-09 15:25:53,557 INFO L226 Difference]: Without dead ends: 556 [2025-01-09 15:25:53,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:25:53,558 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 137 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:53,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1193 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:53,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-01-09 15:25:53,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 551. [2025-01-09 15:25:53,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 502 states have (on average 1.342629482071713) internal successors, (674), 504 states have internal predecessors, (674), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 15:25:53,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 762 transitions. [2025-01-09 15:25:53,598 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 762 transitions. Word has length 123 [2025-01-09 15:25:53,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:53,600 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 762 transitions. [2025-01-09 15:25:53,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:53,600 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 762 transitions. [2025-01-09 15:25:53,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:25:53,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:53,601 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:53,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:25:53,601 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:53,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:53,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1148373096, now seen corresponding path program 1 times [2025-01-09 15:25:53,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:53,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082486565] [2025-01-09 15:25:53,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:53,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:53,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:25:53,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:25:53,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:53,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:53,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:53,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082486565] [2025-01-09 15:25:53,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082486565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:53,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:53,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:25:53,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231488766] [2025-01-09 15:25:53,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:53,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:25:53,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:53,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:25:53,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:53,820 INFO L87 Difference]: Start difference. First operand 551 states and 762 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:54,080 INFO L93 Difference]: Finished difference Result 1436 states and 1990 transitions. [2025-01-09 15:25:54,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:25:54,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2025-01-09 15:25:54,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:54,087 INFO L225 Difference]: With dead ends: 1436 [2025-01-09 15:25:54,087 INFO L226 Difference]: Without dead ends: 888 [2025-01-09 15:25:54,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:25:54,089 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 138 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:54,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 873 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:25:54,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2025-01-09 15:25:54,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 551. [2025-01-09 15:25:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 502 states have (on average 1.3286852589641434) internal successors, (667), 504 states have internal predecessors, (667), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 15:25:54,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 755 transitions. [2025-01-09 15:25:54,136 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 755 transitions. Word has length 123 [2025-01-09 15:25:54,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:54,136 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 755 transitions. [2025-01-09 15:25:54,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:54,137 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 755 transitions. [2025-01-09 15:25:54,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:25:54,138 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:54,138 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:54,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:25:54,138 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:54,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:54,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1606643204, now seen corresponding path program 1 times [2025-01-09 15:25:54,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:54,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099396778] [2025-01-09 15:25:54,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:54,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:54,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:25:54,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:25:54,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:54,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:54,339 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:54,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:54,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099396778] [2025-01-09 15:25:54,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099396778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:54,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:54,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:25:54,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386813354] [2025-01-09 15:25:54,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:54,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:25:54,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:54,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:25:54,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:54,340 INFO L87 Difference]: Start difference. First operand 551 states and 755 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:54,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:54,430 INFO L93 Difference]: Finished difference Result 1103 states and 1510 transitions. [2025-01-09 15:25:54,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:25:54,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2025-01-09 15:25:54,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:54,433 INFO L225 Difference]: With dead ends: 1103 [2025-01-09 15:25:54,433 INFO L226 Difference]: Without dead ends: 532 [2025-01-09 15:25:54,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:54,434 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 62 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:54,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 875 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-09 15:25:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 526. [2025-01-09 15:25:54,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 477 states have (on average 1.310272536687631) internal successors, (625), 479 states have internal predecessors, (625), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 15:25:54,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 713 transitions. [2025-01-09 15:25:54,469 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 713 transitions. Word has length 123 [2025-01-09 15:25:54,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:54,471 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 713 transitions. [2025-01-09 15:25:54,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 713 transitions. [2025-01-09 15:25:54,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 15:25:54,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:54,472 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:54,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:25:54,472 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:54,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:54,473 INFO L85 PathProgramCache]: Analyzing trace with hash -557154171, now seen corresponding path program 1 times [2025-01-09 15:25:54,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:54,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796305221] [2025-01-09 15:25:54,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:54,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:54,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:25:54,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:25:54,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:54,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:54,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:54,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796305221] [2025-01-09 15:25:54,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796305221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:54,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:54,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:25:54,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088755546] [2025-01-09 15:25:54,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:54,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:25:54,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:54,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:25:54,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:54,740 INFO L87 Difference]: Start difference. First operand 526 states and 713 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:54,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:54,838 INFO L93 Difference]: Finished difference Result 1049 states and 1423 transitions. [2025-01-09 15:25:54,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:25:54,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-01-09 15:25:54,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:54,840 INFO L225 Difference]: With dead ends: 1049 [2025-01-09 15:25:54,840 INFO L226 Difference]: Without dead ends: 526 [2025-01-09 15:25:54,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:54,841 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 2 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:54,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 656 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:54,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-01-09 15:25:54,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 512. [2025-01-09 15:25:54,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 463 states have (on average 1.2980561555075594) internal successors, (601), 465 states have internal predecessors, (601), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 15:25:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 689 transitions. [2025-01-09 15:25:54,895 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 689 transitions. Word has length 124 [2025-01-09 15:25:54,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:54,895 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 689 transitions. [2025-01-09 15:25:54,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:54,895 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 689 transitions. [2025-01-09 15:25:54,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 15:25:54,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:54,897 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:54,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:25:54,897 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:54,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:54,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2048869383, now seen corresponding path program 1 times [2025-01-09 15:25:54,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:54,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511955005] [2025-01-09 15:25:54,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:54,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:54,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:25:54,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:25:54,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:54,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:55,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:55,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511955005] [2025-01-09 15:25:55,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511955005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:55,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:55,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:25:55,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848537339] [2025-01-09 15:25:55,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:55,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:25:55,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:55,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:25:55,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:25:55,870 INFO L87 Difference]: Start difference. First operand 512 states and 689 transitions. Second operand has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:56,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:56,387 INFO L93 Difference]: Finished difference Result 1212 states and 1636 transitions. [2025-01-09 15:25:56,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:25:56,389 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-01-09 15:25:56,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:56,392 INFO L225 Difference]: With dead ends: 1212 [2025-01-09 15:25:56,392 INFO L226 Difference]: Without dead ends: 703 [2025-01-09 15:25:56,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:25:56,394 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 127 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:56,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1766 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:25:56,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2025-01-09 15:25:56,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 671. [2025-01-09 15:25:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 594 states have (on average 1.3080808080808082) internal successors, (777), 598 states have internal predecessors, (777), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:25:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 913 transitions. [2025-01-09 15:25:56,464 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 913 transitions. Word has length 124 [2025-01-09 15:25:56,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:56,464 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 913 transitions. [2025-01-09 15:25:56,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:56,464 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 913 transitions. [2025-01-09 15:25:56,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 15:25:56,465 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:56,465 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:56,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 15:25:56,466 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:56,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:56,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1953349431, now seen corresponding path program 1 times [2025-01-09 15:25:56,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:56,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144556241] [2025-01-09 15:25:56,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:56,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:56,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:25:56,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:25:56,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:56,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:06,932 WARN L286 SmtUtils]: Spent 5.55s on a formula simplification that was a NOOP. DAG size: 91 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 15:26:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:26:25,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:25,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144556241] [2025-01-09 15:26:25,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144556241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:25,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:25,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:26:25,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541220618] [2025-01-09 15:26:25,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:25,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:26:25,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:25,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:26:25,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:26:25,475 INFO L87 Difference]: Start difference. First operand 671 states and 913 transitions. Second operand has 12 states, 10 states have (on average 6.7) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:26:34,692 WARN L286 SmtUtils]: Spent 7.33s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 15:26:38,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:26:48,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:48,497 INFO L93 Difference]: Finished difference Result 1388 states and 1891 transitions. [2025-01-09 15:26:48,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:26:48,497 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.7) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 124 [2025-01-09 15:26:48,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:48,500 INFO L225 Difference]: With dead ends: 1388 [2025-01-09 15:26:48,500 INFO L226 Difference]: Without dead ends: 720 [2025-01-09 15:26:48,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:26:48,502 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 117 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 2141 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:48,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 2141 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2025-01-09 15:26:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-01-09 15:26:48,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 643. [2025-01-09 15:26:48,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 566 states have (on average 1.3109540636042403) internal successors, (742), 570 states have internal predecessors, (742), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:26:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 878 transitions. [2025-01-09 15:26:48,567 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 878 transitions. Word has length 124 [2025-01-09 15:26:48,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:48,568 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 878 transitions. [2025-01-09 15:26:48,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.7) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:26:48,568 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 878 transitions. [2025-01-09 15:26:48,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:26:48,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:48,570 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:48,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 15:26:48,570 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:48,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:48,570 INFO L85 PathProgramCache]: Analyzing trace with hash -285543313, now seen corresponding path program 1 times [2025-01-09 15:26:48,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:48,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814746479] [2025-01-09 15:26:48,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:48,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:48,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:26:48,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:26:48,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:48,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:26:48,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:48,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814746479] [2025-01-09 15:26:48,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814746479] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:48,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:48,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:26:48,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802372177] [2025-01-09 15:26:48,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:48,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:26:48,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:48,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:26:48,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:26:48,843 INFO L87 Difference]: Start difference. First operand 643 states and 878 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:26:49,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:49,171 INFO L93 Difference]: Finished difference Result 1853 states and 2536 transitions. [2025-01-09 15:26:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:26:49,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-01-09 15:26:49,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:49,177 INFO L225 Difference]: With dead ends: 1853 [2025-01-09 15:26:49,177 INFO L226 Difference]: Without dead ends: 1213 [2025-01-09 15:26:49,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:26:49,180 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 120 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:49,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1233 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:26:49,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2025-01-09 15:26:49,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 775. [2025-01-09 15:26:49,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 698 states have (on average 1.2922636103151863) internal successors, (902), 702 states have internal predecessors, (902), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:26:49,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1038 transitions. [2025-01-09 15:26:49,254 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1038 transitions. Word has length 125 [2025-01-09 15:26:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:49,255 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1038 transitions. [2025-01-09 15:26:49,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:26:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1038 transitions. [2025-01-09 15:26:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:26:49,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:49,256 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:49,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 15:26:49,257 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:49,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:49,257 INFO L85 PathProgramCache]: Analyzing trace with hash 22228297, now seen corresponding path program 1 times [2025-01-09 15:26:49,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:49,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067278242] [2025-01-09 15:26:49,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:49,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:49,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:26:49,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:26:49,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:49,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:49,936 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:26:49,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:49,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067278242] [2025-01-09 15:26:49,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067278242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:49,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:49,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:26:49,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050830799] [2025-01-09 15:26:49,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:49,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:26:49,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:49,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:26:49,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:26:49,938 INFO L87 Difference]: Start difference. First operand 775 states and 1038 transitions. Second operand has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:26:51,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:51,255 INFO L93 Difference]: Finished difference Result 1931 states and 2596 transitions. [2025-01-09 15:26:51,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:26:51,259 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 125 [2025-01-09 15:26:51,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:51,263 INFO L225 Difference]: With dead ends: 1931 [2025-01-09 15:26:51,263 INFO L226 Difference]: Without dead ends: 1159 [2025-01-09 15:26:51,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:26:51,265 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 417 mSDsluCounter, 2493 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 2827 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:51,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 2827 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 15:26:51,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-01-09 15:26:51,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 845. [2025-01-09 15:26:51,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 768 states have (on average 1.2864583333333333) internal successors, (988), 772 states have internal predecessors, (988), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:26:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1124 transitions. [2025-01-09 15:26:51,331 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1124 transitions. Word has length 125 [2025-01-09 15:26:51,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:51,332 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1124 transitions. [2025-01-09 15:26:51,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:26:51,332 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1124 transitions. [2025-01-09 15:26:51,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:26:51,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:51,333 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:51,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 15:26:51,333 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:51,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:51,334 INFO L85 PathProgramCache]: Analyzing trace with hash 723828171, now seen corresponding path program 1 times [2025-01-09 15:26:51,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:51,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493900467] [2025-01-09 15:26:51,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:51,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:51,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:26:51,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:26:51,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:51,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:26:51,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:51,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493900467] [2025-01-09 15:26:51,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493900467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:51,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:51,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:26:51,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680973237] [2025-01-09 15:26:51,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:51,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:26:51,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:51,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:26:51,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:26:51,499 INFO L87 Difference]: Start difference. First operand 845 states and 1124 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:26:51,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:51,634 INFO L93 Difference]: Finished difference Result 1646 states and 2191 transitions. [2025-01-09 15:26:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:26:51,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-01-09 15:26:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:51,637 INFO L225 Difference]: With dead ends: 1646 [2025-01-09 15:26:51,637 INFO L226 Difference]: Without dead ends: 804 [2025-01-09 15:26:51,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:26:51,639 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 70 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:51,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 855 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:26:51,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-01-09 15:26:51,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 800. [2025-01-09 15:26:51,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 723 states have (on average 1.2821576763485478) internal successors, (927), 727 states have internal predecessors, (927), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 15:26:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1063 transitions. [2025-01-09 15:26:51,722 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1063 transitions. Word has length 125 [2025-01-09 15:26:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:51,722 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1063 transitions. [2025-01-09 15:26:51,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:26:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1063 transitions. [2025-01-09 15:26:51,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:26:51,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:51,723 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:51,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 15:26:51,724 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:51,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:51,724 INFO L85 PathProgramCache]: Analyzing trace with hash 384268553, now seen corresponding path program 1 times [2025-01-09 15:26:51,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:51,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888744340] [2025-01-09 15:26:51,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:51,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:51,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:26:51,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:26:51,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:51,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:26:52,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:52,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888744340] [2025-01-09 15:26:52,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888744340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:52,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:52,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:26:52,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028889595] [2025-01-09 15:26:52,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:52,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:26:52,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:52,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:26:52,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:26:52,236 INFO L87 Difference]: Start difference. First operand 800 states and 1063 transitions. Second operand has 10 states, 8 states have (on average 8.5) internal successors, (68), 10 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:26:52,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:52,677 INFO L93 Difference]: Finished difference Result 1646 states and 2190 transitions. [2025-01-09 15:26:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:26:52,680 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.5) internal successors, (68), 10 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 125 [2025-01-09 15:26:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:52,684 INFO L225 Difference]: With dead ends: 1646 [2025-01-09 15:26:52,684 INFO L226 Difference]: Without dead ends: 849 [2025-01-09 15:26:52,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:26:52,685 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 116 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:52,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1696 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:26:52,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2025-01-09 15:26:52,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 416. [2025-01-09 15:26:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 377 states have (on average 1.2758620689655173) internal successors, (481), 379 states have internal predecessors, (481), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:26:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 549 transitions. [2025-01-09 15:26:52,739 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 549 transitions. Word has length 125 [2025-01-09 15:26:52,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:52,739 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 549 transitions. [2025-01-09 15:26:52,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.5) internal successors, (68), 10 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:26:52,739 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 549 transitions. [2025-01-09 15:26:52,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:26:52,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:52,741 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:52,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 15:26:52,741 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:52,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:52,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1199030442, now seen corresponding path program 1 times [2025-01-09 15:26:52,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:52,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650952909] [2025-01-09 15:26:52,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:52,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:52,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:26:52,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:26:52,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:52,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:26:53,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:53,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650952909] [2025-01-09 15:26:53,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650952909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:53,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:53,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:26:53,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101546453] [2025-01-09 15:26:53,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:53,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:26:53,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:53,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:26:53,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:26:53,186 INFO L87 Difference]: Start difference. First operand 416 states and 549 transitions. Second operand has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 10 states have internal predecessors, (70), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:26:53,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:53,636 INFO L93 Difference]: Finished difference Result 1106 states and 1466 transitions. [2025-01-09 15:26:53,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:26:53,640 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 10 states have internal predecessors, (70), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2025-01-09 15:26:53,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:53,642 INFO L225 Difference]: With dead ends: 1106 [2025-01-09 15:26:53,642 INFO L226 Difference]: Without dead ends: 693 [2025-01-09 15:26:53,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:26:53,643 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 187 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:53,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1392 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:26:53,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-01-09 15:26:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 638. [2025-01-09 15:26:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 575 states have (on average 1.2730434782608695) internal successors, (732), 578 states have internal predecessors, (732), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 15:26:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 844 transitions. [2025-01-09 15:26:53,698 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 844 transitions. Word has length 127 [2025-01-09 15:26:53,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:53,698 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 844 transitions. [2025-01-09 15:26:53,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 10 states have internal predecessors, (70), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:26:53,698 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 844 transitions. [2025-01-09 15:26:53,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:26:53,699 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:53,699 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:53,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 15:26:53,699 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:53,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:53,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1293398769, now seen corresponding path program 1 times [2025-01-09 15:26:53,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:53,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777511238] [2025-01-09 15:26:53,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:53,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:53,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:26:53,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:26:53,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:53,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:26:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:26:53,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:26:53,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777511238] [2025-01-09 15:26:53,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777511238] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:26:53,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:26:53,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:26:53,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527342883] [2025-01-09 15:26:53,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:53,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:26:53,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:26:53,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:26:53,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:26:53,923 INFO L87 Difference]: Start difference. First operand 638 states and 844 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:26:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:26:54,245 INFO L93 Difference]: Finished difference Result 1638 states and 2199 transitions. [2025-01-09 15:26:54,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:26:54,246 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 129 [2025-01-09 15:26:54,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:26:54,249 INFO L225 Difference]: With dead ends: 1638 [2025-01-09 15:26:54,249 INFO L226 Difference]: Without dead ends: 1003 [2025-01-09 15:26:54,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:26:54,251 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 107 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:26:54,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1024 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:26:54,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2025-01-09 15:26:54,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 691. [2025-01-09 15:26:54,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 628 states have (on average 1.2818471337579618) internal successors, (805), 631 states have internal predecessors, (805), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 15:26:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 917 transitions. [2025-01-09 15:26:54,333 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 917 transitions. Word has length 129 [2025-01-09 15:26:54,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:26:54,333 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 917 transitions. [2025-01-09 15:26:54,333 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:26:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 917 transitions. [2025-01-09 15:26:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:26:54,334 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:26:54,334 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:54,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 15:26:54,334 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:26:54,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:26:54,335 INFO L85 PathProgramCache]: Analyzing trace with hash 900371759, now seen corresponding path program 1 times [2025-01-09 15:26:54,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:26:54,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359794253] [2025-01-09 15:26:54,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:26:54,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:26:54,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:26:54,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:26:54,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:54,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:26:54,368 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:26:54,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:26:54,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:26:54,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:26:54,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:26:54,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:26:54,443 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:26:54,443 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:26:54,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 15:26:54,447 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:26:54,585 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:26:54,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:26:54 BoogieIcfgContainer [2025-01-09 15:26:54,588 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:26:54,589 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:26:54,589 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:26:54,589 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:26:54,593 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:25:38" (3/4) ... [2025-01-09 15:26:54,594 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:26:54,595 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:26:54,595 INFO L158 Benchmark]: Toolchain (without parser) took 76876.67ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 112.6MB in the beginning and 115.5MB in the end (delta: -2.8MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2025-01-09 15:26:54,596 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:26:54,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.90ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 97.6MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:26:54,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.57ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 93.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:26:54,596 INFO L158 Benchmark]: Boogie Preprocessor took 70.23ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 88.3MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:26:54,596 INFO L158 Benchmark]: RCFGBuilder took 646.98ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 52.9MB in the end (delta: 35.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:26:54,599 INFO L158 Benchmark]: TraceAbstraction took 75836.89ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 52.5MB in the beginning and 119.9MB in the end (delta: -67.4MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2025-01-09 15:26:54,600 INFO L158 Benchmark]: Witness Printer took 6.11ms. Allocated memory is still 167.8MB. Free memory was 115.7MB in the beginning and 115.5MB in the end (delta: 198.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:26:54,600 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.90ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 97.6MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.57ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 93.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.23ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 88.3MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 646.98ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 52.9MB in the end (delta: 35.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 75836.89ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 52.5MB in the beginning and 119.9MB in the end (delta: -67.4MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * Witness Printer took 6.11ms. Allocated memory is still 167.8MB. Free memory was 115.7MB in the beginning and 115.5MB in the end (delta: 198.3kB). 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 someBinaryArithmeticDOUBLEoperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L28-L30] signed char signed_char_Array_0[3] = { 5, 1, 25 }; [L28-L30] signed char signed_char_Array_0[3] = { 5, 1, 25 }; [L28-L30] signed char signed_char_Array_0[3] = { 5, 1, 25 }; [L28-L30] signed char signed_char_Array_0[3] = { 5, 1, 25 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -50 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -50 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 50, 2 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 50, 2 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 50, 2 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 19138, 0 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 19138, 0 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 19138, 0 }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] isInitial = 1 [L94] FCALL initially() [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L65] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] double_Array_0[0] = __VERIFIER_nondet_double() [L69] EXPR double_Array_0[0] [L69] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L69] EXPR double_Array_0[0] [L69] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] double_Array_0[1] = __VERIFIER_nondet_double() [L71] EXPR double_Array_0[1] [L71] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L71] EXPR double_Array_0[1] [L71] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] double_Array_0[3] = __VERIFIER_nondet_double() [L73] EXPR double_Array_0[3] [L73] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F [L73] EXPR double_Array_0[3] [L73] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] CALL assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] RET assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] double_Array_0[4] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[4] [L75] EXPR double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] EXPR double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F [L75] EXPR double_Array_0[4] [L75] EXPR double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] EXPR (double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] EXPR (double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] CALL assume_abort_if_not((double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] RET assume_abort_if_not((double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L80] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L83] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] RET updateVariables() [L98] CALL step() [L43] EXPR unsigned_char_Array_0[1] [L43] unsigned_char_Array_0[0] = unsigned_char_Array_0[1] [L44] EXPR signed_char_Array_0[0] [L44] signed_char_Array_0[1] = signed_char_Array_0[0] [L45] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L48] EXPR BOOL_unsigned_char_Array_0[0] [L48] BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] COND FALSE !(BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) [L51] EXPR unsigned_short_int_Array_0[0] [L51] unsigned short int stepLocal_0 = unsigned_short_int_Array_0[0]; [L52] EXPR unsigned_char_Array_0[0] [L52] EXPR unsigned_char_Array_0[0] [L52] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L52] EXPR unsigned_char_Array_0[0] << unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-32769, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L52] EXPR ((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0])) [L52] EXPR unsigned_char_Array_0[0] [L52] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L52] EXPR unsigned_char_Array_0[0] << unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-32769, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L52] EXPR ((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-32769, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L52] COND FALSE !(stepLocal_0 <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) [L55] EXPR unsigned_char_Array_0[0] [L55] EXPR unsigned_short_int_Array_0[1] [L55] EXPR unsigned_short_int_Array_0[0] [L55] signed_long_int_Array_0[0] = (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])) [L57] EXPR unsigned_char_Array_0[0] [L57] unsigned char stepLocal_1 = unsigned_char_Array_0[0]; [L58] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] COND FALSE !(unsigned_char_Array_0[0] < stepLocal_1) [L61] EXPR double_Array_0[4] [L61] EXPR double_Array_0[0] [L61] EXPR double_Array_0[1] [L61] double_Array_0[2] = ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]) [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1 [L89] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1) [L89] EXPR BOOL_unsigned_char_Array_0[0] [L89] EXPR BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1 [L89] EXPR (BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0]))))) [L89] EXPR unsigned_short_int_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR unsigned_char_Array_0[0] << unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0])) [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR unsigned_char_Array_0[0] << unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))) [L89] EXPR signed_long_int_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_short_int_Array_0[1] [L89] EXPR unsigned_short_int_Array_0[0] [L89] EXPR (unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1])))) [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))) [L89] EXPR double_Array_0[2] [L89] EXPR double_Array_0[4] [L89] EXPR double_Array_0[0] [L89] EXPR double_Array_0[1] [L89] EXPR (unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89-L90] return (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 75.7s, OverallIterations: 28, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 33.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3428 SdHoareTripleChecker+Valid, 14.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3406 mSDsluCounter, 29862 SdHoareTripleChecker+Invalid, 13.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24332 mSDsCounter, 202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7026 IncrementalHoareTripleChecker+Invalid, 7228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 202 mSolverCounterUnsat, 5530 mSDtfsCounter, 7026 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 791 GetRequests, 571 SyntacticMatches, 4 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 28.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=845occurred in iteration=23, InterpolantAutomatonStates: 224, 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, 27 MinimizatonAttempts, 2886 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 38.2s InterpolantComputationTime, 3887 NumberOfCodeBlocks, 3887 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3727 ConstructedInterpolants, 0 QuantifiedInterpolants, 17403 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1722 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 31 InterpolantComputations, 27 PerfectInterpolantSequences, 8063/8184 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 15:26:54,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2cb36cc0f0fd05117e5167c95d28ca6a711637d120a8a77c2820981a0c818fc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:26:56,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:26:56,579 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:26:56,583 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:26:56,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:26:56,598 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:26:56,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:26:56,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:26:56,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:26:56,599 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:26:56,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:26:56,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:26:56,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:26:56,599 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:26:56,599 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:26:56,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:26:56,600 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:26:56,600 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:26:56,600 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:26:56,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:26:56,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:26:56,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:26:56,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:26:56,604 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:26:56,604 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:26:56,604 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:26:56,604 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:26:56,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:26:56,604 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:26:56,604 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:26:56,604 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:26:56,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:26:56,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:26:56,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:26:56,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:26:56,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:26:56,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:26:56,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:26:56,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:26:56,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:26:56,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:26:56,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:26:56,605 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:26:56,605 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:26:56,606 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:26:56,606 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:26:56,606 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:26:56,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:26:56,606 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:26:56,606 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:26:56,606 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2cb36cc0f0fd05117e5167c95d28ca6a711637d120a8a77c2820981a0c818fc [2025-01-09 15:26:56,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:26:56,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:26:56,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:26:56,811 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:26:56,811 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:26:56,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i [2025-01-09 15:26:57,965 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca1c047d5/d3842b30a5d3470f8e481fdf3c64ae05/FLAGf457974b4 [2025-01-09 15:26:58,184 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:26:58,185 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i [2025-01-09 15:26:58,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca1c047d5/d3842b30a5d3470f8e481fdf3c64ae05/FLAGf457974b4 [2025-01-09 15:26:58,543 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca1c047d5/d3842b30a5d3470f8e481fdf3c64ae05 [2025-01-09 15:26:58,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:26:58,547 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:26:58,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:26:58,548 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:26:58,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:26:58,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:26:58" (1/1) ... [2025-01-09 15:26:58,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2395d649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:58, skipping insertion in model container [2025-01-09 15:26:58,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:26:58" (1/1) ... [2025-01-09 15:26:58,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:26:58,663 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i[916,929] [2025-01-09 15:26:58,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:26:58,723 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:26:58,734 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i[916,929] [2025-01-09 15:26:58,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:26:58,774 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:26:58,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:58 WrapperNode [2025-01-09 15:26:58,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:26:58,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:26:58,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:26:58,776 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:26:58,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:58" (1/1) ... [2025-01-09 15:26:58,796 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:58" (1/1) ... [2025-01-09 15:26:58,835 INFO L138 Inliner]: procedures = 36, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2025-01-09 15:26:58,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:26:58,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:26:58,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:26:58,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:26:58,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:58" (1/1) ... [2025-01-09 15:26:58,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:58" (1/1) ... [2025-01-09 15:26:58,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:58" (1/1) ... [2025-01-09 15:26:58,865 INFO L175 MemorySlicer]: Split 132 memory accesses to 7 slices as follows [2, 8, 39, 12, 5, 41, 25]. 31 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 3, 1, 2, 2]. The 16 writes are split as follows [0, 1, 6, 3, 2, 2, 2]. [2025-01-09 15:26:58,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:58" (1/1) ... [2025-01-09 15:26:58,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:58" (1/1) ... [2025-01-09 15:26:58,883 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:58" (1/1) ... [2025-01-09 15:26:58,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:58" (1/1) ... [2025-01-09 15:26:58,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:58" (1/1) ... [2025-01-09 15:26:58,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:58" (1/1) ... [2025-01-09 15:26:58,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:58" (1/1) ... [2025-01-09 15:26:58,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:26:58,911 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:26:58,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:26:58,915 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:26:58,915 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:58" (1/1) ... [2025-01-09 15:26:58,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:26:58,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:26:58,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:26:58,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:26:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:26:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:26:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:26:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-01-09 15:26:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-01-09 15:26:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-01-09 15:26:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-01-09 15:26:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-01-09 15:26:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:26:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:26:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-01-09 15:26:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-01-09 15:26:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-01-09 15:26:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-01-09 15:26:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-01-09 15:26:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:26:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:26:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:26:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:26:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:26:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:26:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-01-09 15:26:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 15:26:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 15:26:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-09 15:26:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-09 15:26:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-09 15:26:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-01-09 15:26:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-01-09 15:26:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:26:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:26:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:26:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:26:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:26:58,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:26:58,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-01-09 15:26:58,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-09 15:26:58,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-09 15:26:58,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-01-09 15:26:58,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-01-09 15:26:58,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:26:58,967 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:26:58,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:26:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:26:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:26:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:26:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:26:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:26:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-01-09 15:26:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:26:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:26:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-01-09 15:26:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-01-09 15:26:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-01-09 15:26:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-01-09 15:26:58,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-01-09 15:26:58,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 15:26:58,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 15:26:58,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-01-09 15:26:58,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-01-09 15:26:58,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-01-09 15:26:58,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-01-09 15:26:58,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-01-09 15:26:59,118 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:26:59,119 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:27:01,585 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2025-01-09 15:27:01,585 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:27:01,595 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:27:01,596 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:27:01,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:27:01 BoogieIcfgContainer [2025-01-09 15:27:01,596 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:27:01,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:27:01,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:27:01,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:27:01,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:26:58" (1/3) ... [2025-01-09 15:27:01,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a056de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:27:01, skipping insertion in model container [2025-01-09 15:27:01,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:58" (2/3) ... [2025-01-09 15:27:01,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a056de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:27:01, skipping insertion in model container [2025-01-09 15:27:01,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:27:01" (3/3) ... [2025-01-09 15:27:01,605 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-70.i [2025-01-09 15:27:01,616 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:27:01,617 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-70.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:27:01,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:27:01,670 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;@2c4e12a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:27:01,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:27:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 86 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:27:01,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:27:01,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:01,683 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:01,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:01,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:01,690 INFO L85 PathProgramCache]: Analyzing trace with hash -498553119, now seen corresponding path program 1 times [2025-01-09 15:27:01,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:01,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036084327] [2025-01-09 15:27:01,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:01,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:01,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:01,701 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:27:01,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 15:27:01,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:27:02,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:27:02,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:02,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:02,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:27:02,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-09 15:27:02,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:02,090 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:02,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036084327] [2025-01-09 15:27:02,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036084327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:02,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:02,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:27:02,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456147722] [2025-01-09 15:27:02,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:02,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:27:02,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:02,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:27:02,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:27:02,110 INFO L87 Difference]: Start difference. First operand has 100 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 86 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:27:02,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:02,126 INFO L93 Difference]: Finished difference Result 194 states and 299 transitions. [2025-01-09 15:27:02,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:27:02,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-01-09 15:27:02,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:02,131 INFO L225 Difference]: With dead ends: 194 [2025-01-09 15:27:02,131 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 15:27:02,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:27:02,135 INFO L435 NwaCegarLoop]: 141 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, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:02,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:02,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 15:27:02,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 15:27:02,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 83 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:27:02,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2025-01-09 15:27:02,158 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 115 [2025-01-09 15:27:02,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:02,159 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2025-01-09 15:27:02,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:27:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2025-01-09 15:27:02,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:27:02,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:02,161 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:02,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 15:27:02,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:02,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:02,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:02,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1089454161, now seen corresponding path program 1 times [2025-01-09 15:27:02,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:02,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379365776] [2025-01-09 15:27:02,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:02,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:02,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:02,367 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:27:02,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 15:27:02,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:27:02,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:27:02,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:02,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:02,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:27:02,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-01-09 15:27:02,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:02,759 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:02,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379365776] [2025-01-09 15:27:02,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379365776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:02,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:02,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:27:02,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093088853] [2025-01-09 15:27:02,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:02,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:27:02,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:02,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:27:02,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:02,763 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:27:02,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:02,836 INFO L93 Difference]: Finished difference Result 193 states and 282 transitions. [2025-01-09 15:27:02,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:27:02,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-01-09 15:27:02,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:02,838 INFO L225 Difference]: With dead ends: 193 [2025-01-09 15:27:02,838 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 15:27:02,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:02,839 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:02,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:27:02,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 15:27:02,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 15:27:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.4) internal successors, (119), 85 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:27:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 143 transitions. [2025-01-09 15:27:02,845 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 143 transitions. Word has length 115 [2025-01-09 15:27:02,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:02,846 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 143 transitions. [2025-01-09 15:27:02,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:27:02,847 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 143 transitions. [2025-01-09 15:27:02,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:27:02,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:02,848 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:02,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:27:03,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:03,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:03,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:03,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1860187727, now seen corresponding path program 1 times [2025-01-09 15:27:03,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:03,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789371810] [2025-01-09 15:27:03,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:03,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:03,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:03,056 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:27:03,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 15:27:03,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:27:03,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:27:03,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:03,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:03,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 15:27:03,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-01-09 15:27:03,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:27:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:27:03,933 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:03,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789371810] [2025-01-09 15:27:03,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789371810] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:03,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:27:03,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-01-09 15:27:03,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014805211] [2025-01-09 15:27:03,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:03,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:27:03,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:03,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:27:03,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:27:03,935 INFO L87 Difference]: Start difference. First operand 99 states and 143 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:27:04,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:04,036 INFO L93 Difference]: Finished difference Result 238 states and 346 transitions. [2025-01-09 15:27:04,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:04,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-01-09 15:27:04,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:04,038 INFO L225 Difference]: With dead ends: 238 [2025-01-09 15:27:04,038 INFO L226 Difference]: Without dead ends: 142 [2025-01-09 15:27:04,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:27:04,039 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 121 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:04,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 393 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:27:04,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-09 15:27:04,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 102. [2025-01-09 15:27:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:27:04,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 146 transitions. [2025-01-09 15:27:04,053 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 146 transitions. Word has length 115 [2025-01-09 15:27:04,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:04,053 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 146 transitions. [2025-01-09 15:27:04,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:27:04,053 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 146 transitions. [2025-01-09 15:27:04,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:27:04,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:04,055 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:04,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0